#include <stdio.h>
FILE *f=fopen ("castel.in", "r");
FILE *g=fopen ("castel.out", "w");
int n,m,k,pi,pj,pr,ult=1,sw,camere;
int v[155][155];
int chei[155*155];
int d1[]={-1, 0, 1, 0};
int d2[]={0, 1, 0, -1};
struct coada { int x,y; } c[155*155], t;


void citire (void) {
int i,j;
fscanf (f, "%d%d%d", &n, &m, &k);
chei[k]=1;
for (i=1;i<=n;i++)
	for (j=1;j<=m;j++)
	{
		fscanf (f, "%d", &v[i][j]);
		if (!pi && v[i][j]==k)
		{
			pi=i;
			pj-j;
		}
	}

}

int valid() {
	if ( !t.x || !t.y || t.x>n || t.y>m )
		return 0;
	if ( !chei[v[t.x][t.y]] )
		return 0;
return 1;
}

void Lee(int pi, int pj) {
int i,nr;
pr=1;
c[pr].x=pi;	c[pr].y=pj;
v[c[pr].x][c[pr].y]=0;
while (pr<=ult)
{
	for (i=0;i<4;i++)
	{
		t.x=c[pr].x+d1[i];
		t.y=c[pr].y+d2[i];
		nr=(t.x-1)*m+t.y;
		if ( valid() )
		{
			if ( !chei[nr] )
			{
				chei[nr]=1;   sw=1;  camere++;
			}
			v[t.x][t.y]=0;
			ult++;
			c[ult].x=t.x;	c[ult].y=t.y;
		}
	}
	pr++;
}
}
			

int main() {
citire();
do
{
	sw=0;
	chei[k]=1;
	Lee(pi, pj);
}
while (sw);

fprintf (g, "%d", camere+1);
return 0;
}