#include <stdio.h>
#include <vector>
#include <bitset>

using namespace std;

long n,m,i,j,k,p,q,li,ci;
long x[22505],y[22205],a[151][151];
long xx,yy,pa,pb,ok,l,poz;
long dx[]={-1,0,1,0};
long dy[]={0,1,0,-1};
bitset <160>mark[160];
bitset <22505>key;
vector <int>v[22505];
             

int main(){
    freopen("castel.in","r",stdin);
    freopen("castel.out","w",stdout);
    
    scanf("%ld %ld %ld",&n,&m,&k);
    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++)
            scanf("%ld",&a[i][j]);
    key[k]=1;
    li=k/m;
    if (k%m==0)ci=m;
    else {li++;ci=k%m;}
    
    p=1;q=1;
    x[1]=li;y[1]=ci;
    mark[li][ci]=1;
    while (p<=q){
          
          poz=(x[p]-1)*m+y[p];
          l=v[poz].size();
          //printf("%ld %ld\n",l,q);
          for (i=0;i<l;i++){
              xx=v[poz][i]/m;
              yy=v[poz][i]%m;
              if (yy==0)yy=m;
              else xx++;
              if (!mark[xx][yy]){
                 q++;
                 x[q]=xx;y[q]=yy;
              }
              mark[xx][yy]=1;
              
          }
          if (l)v[poz].clear();    
          
          for (k=0;k<4;k++){
              xx=x[p]+dx[k];
              yy=y[p]+dy[k];
              if (xx>0&&xx<=n)
                 if (yy>0&&yy<=m)
                    if (!mark[xx][yy])
                       if (key[a[xx][yy]]){
                          q++;
                          x[q]=xx;y[q]=yy;
                          mark[xx][yy]=1;
                          key[(xx-1)*m+yy]=1;
                       }
                       else v[a[xx][yy]].push_back((xx-1)*m+yy);
          }
          p++;
    }
    p=0;
    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++)
            if(mark[i][j])p++;
    printf("%ld\n",p);
    
return 0;
}