#include <bits/stdc++.h>

using namespace std;

int n,m,k,reach[22509],v[22509],ans;

vector <int> chiei[22509];

void castel(int i)
{
    if(reach[i])
    {
        return;
    }
    reach[i]=1;
    ans++;
    if(i%m!=0 && reach[v[i-1]])
    {
        castel(i-1);
    }
    if(i%m!=m-1 && reach[v[i+1]])
    {
        castel(i+1);
    }
    if(i+m<n*m && reach[v[i+m]])
    {
        castel(i+m);
    }
    if(i-m>=0 && reach[v[i-m]])
    {
        castel(i-m);
    }
    for(int j=0; j<chiei[i].size(); j++)
    {
        if(((chiei[i][j]%m!=0 && reach[chiei[i][j]-1]) || (chiei[i][j]%m!=m-1 && reach[chiei[i][j]+1]) || (chiei[i][j]+m<n*m && reach[chiei[i][j]+m]) || (chiei[i][j]-m>=0 && reach[chiei[i][j]-m])))
        {
            castel(chiei[i][j]);
        }
    }
}
int main()
{
    ifstream fin("castel.in");
    ofstream fout("castel.out");
    fin>>n>>m>>k;
    k--;
    for(int i=0; i<n*m; i++)
    {
        fin>>v[i];
        v[i]--;
        chiei[v[i]].push_back(i);
    }
    castel(k);
    fout<<ans;
    return 0;
}