#include<iostream>
#include<algorithm>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
long long s[1005][1005],k,i,j,m,n,up,down,l,r,br1,br2,fl;
int main()
{
    cin>>m>>n;
    cin>>k;
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
        {
            scanf("%lld",&s[i][j]);
        }
    }         
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
        {
             if(s[i][j]==1)
             {
                 s[i][j]=-1;
                 s[i+1][j]=-2;
                 s[i+1][j+1]=-2;
                 s[i][j+1]=-2;
                 s[i-1][j]=-2;
                 s[i-1][j-1]=-2;
                 s[i][j-1]=-2;
                 s[i-1][j+1]=-2;
                 s[i+1][j-1]=-2;
             }
             else
             if(s[i][j]==0)
             s[i][j]=1;
        }
    }
    for(i=1;i<=m;i++)
    {
        l=1;
        r=1;
        for(j=1;j<=n;j++)
        {
            if(s[i][j]==1)
            {
                if(fl==1)
                {
                    fl=0;
                    l=j;
                    r=j;
                }
                if(r<l)r=l;
                if(r-l+1<k)r++;
                if(r-l+1==k&&s[i][r]==1&&s[i][l]==1){l++;br1++;}
                if(s[i][r]==0)break;
            }
            else
            {
                fl=1;
            }
        }
    }
    for(i=1;i<=m;i++)
    {
        l=1;
        r=1;
        for(j=1;j<=n;j++)
        {
            if(s[i][j]==1)
            {
                if(fl==1)
                {
                    fl=0;
                    l=i;
                    r=i;
                }
                if(r<l)r=l;
                if(r-l+1<k)r++;
                if(r-l+1==k&&s[i][r]==1&&s[r][j]==1){l++;br2++;}
                if(s[j][i]==0)break;
            }
            else
            {
                fl=1;
            }
        }
    }
    cout<<br1<<" "<<br2<<endl;
    return 0;
}
/*
5 6
2
1 0 0 0 0 0 
1 0 0 0 0 0
1 0 0 0 0 0
0 0 0 0 1 1
0 0 0 0 0 0

3 4
2
0 0 0 0
0 0 0 0
0 1 1 1
*/