#include<stdio.h>
#include<vector>
#include<queue>
#include<string.h>

using namespace std;

int n,m,sx,sy;
int a[151][151];

int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

queue< pair<short int,short int> > chei[25000];
queue< pair<short int,short int> > coada;

int bfs()
{
	pair<short int,short int> nod,nod1;
	int key,total=0,x,y,i;
	bool vizitat[25000];

	memset(vizitat,false,sizeof(vizitat));
	coada.push(make_pair(sx,sy));
	vizitat[(sx-1)*m+sy]=true;
	vizitat[a[sx][sy]]=true;

	while(coada.size()>0)
	{
		nod=coada.front();
		coada.pop();
		key=(nod.first-1)*m+nod.second;
		total++;
	
		while(chei[key].size()>0)
		{
			nod1=chei[key].front();
			chei[key].pop();
			if(vizitat[(nod1.first-1)*m+nod1.second]==false)
			{
				vizitat[(nod1.first-1)*m+nod1.second]=true;
				coada.push(nod1);
			}
		}

		for(i=0;i<4;i++)
		{
			x=nod.first+dx[i];
			y=nod.second+dy[i];
			if(x>=1 && x<=n && y>=1 && y<=m && vizitat[(x-1)*m+y]==0)
			{
				if(vizitat[a[x][y]]==true)
				{
					vizitat[(x-1)*m+y]=1;
					coada.push(make_pair(x,y));
				}
				else
					chei[a[x][y]].push(make_pair(x,y));	
			}
		}
	}
	return total;
}
			
int main()
{
	int i,j,k;
	FILE *f=fopen("castel.in","r");
	fscanf(f,"%i%i%i",&n,&m,&k);

	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			fscanf(f,"%d",&a[i][j]);
	fclose(f);

	if(k%m!=0)
	{
		sx=k/m+1;
		sy=k%m;
	}
	else
	{		
		sx=k/m;
		sy=m;
	}


	f=fopen("castel.out","w");
	fprintf(f,"%i\n",bfs());
	fclose(f);
	return 0;
}