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

using namespace std;

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

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

int bfs()
{
	queue< pair<int,int> > chei[25000];
	queue< pair<int,int> > coada;
	pair<int,int> nod,nod1;
	int cheie[25000],key,vizitat[150][150],total=0,x,y;

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

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

		for(int 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][y]==0)
			{
				if(cheie[a[x][y]]==1)
				{
					vizitat[x][y]=1;
					coada.push(make_pair(x,y));
					cheie[(x-1)*m+y]=1;
				}
				else
					chei[(x-1)*m+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,"%i",&a[i][j]);
	fclose(f);

	sx=k/m+1;
	sy=k%m;
	f=fopen("total.out","w");
	fprintf(f,"%i\n",bfs());
	fclose(f);
	return 0;
}