#include<iostream>
#include<cmath>
#include<cstdio>
#include<string>
#include<stack>
#include<algorithm>
using namespace std;
long long i,j,x[1001][1001],i1,j11,br,ans1,m,n,k,br1,ans2,i2,j2;
int main()
{
   cin>>m>>n;
   cin>>k;
   for(i=1;i<=m+1; i++)
   {
      for(j=1; j<=n+1; j++)
      {
         if(j<=n&&i<=m) cin>>x[i][j];
         if(i>=2)
         {
            
            i1=i-1;
            j11=j-1;
            if(i1==0||j11==0) continue;
            if(x[i1][j11]!=1&&x[i1+1][j11]!=1&&x[i1+1][j11+1]!=1&&x[i1][j11+1]!=1&&x[i1-1][j11+1]!=1&&x[i1-1][j11]!=1&&x[i1-1][j11-1]!=1&&x[i1][j11-1]!=1&&x[i1+1][j11-1]!=1)
               {
               br++;
               
               }
            else
            {
               if(br>=k)ans1+=br-k+1;
               br=0;
            }
         }
      }
      if(br>=k) ans1+=br-k+1;
      br=0;
   }
   for(j=1; j<=n; j++)
   {
      for(i=1; i<=m; i++)
      {
      if(x[i][j]!=1&&x[i+1][j]!=1&&x[i+1][j+1]!=1&&x[i][j+1]!=1&&x[i-1][j+1]!=1&&x[i-1][j]!=1&&x[i-1][j-1]!=1&&x[i][j-1]!=1&&x[i+1][j-1]!=1)
      {
            br1++;
      }
      else
      {
         if(br1>=k)ans2+=br1-k+1;
         br1=0;
      }
      }
      if(br1>=k)ans2+=br1-k+1;
      br1=0;
   }
   cout<<ans1<<" "<<ans2<<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
*/