#include <iostream>
#include <queue>
#include <fstream>
using namespace std;
ifstream f("castel.in");
ofstream g("castel.out");
const short vi[5] = {-1, 0, 1, 0}, vj[5] = {0, 1, 0, -1};
int a[155][155];
int req[155][155];
int n, m;
int Starti, Startj, Fini, Finj;
bool ok;
int nrCam = 1;
bool chei[22505];
queue<pair<int, int > > Q;

void lee()
{
    a[Starti][Startj] = 1;
    Q.push(make_pair(Starti, Startj));
    while(!Q.empty())
    {
        int i = Q.front().first;
        int j = Q.front().second;
        Q.pop();
        for(int v = 0; v<4; v++)
        {
            int iv = i+vi[v];
            int jv = j+vj[v];
            if(chei[req[iv][jv]] && a[iv][jv] == 0)
            {
                a[iv][jv] = a[i][j]+1;
                if(chei[(iv-1)*m+jv] == 0)
                {
                    ok = 1;
                    nrCam++;
                }
                chei[(iv-1)*m+jv] = 1;
                Q.push(make_pair(iv, jv));
            }
        }
    }
}

void bordare()
{
    for(int i = 0; i<=n+1; i++)
    {
        a[i][0] = -1 ;
        a[i][m+1] = -1;
    }
    for(int j = 1; j<=m; j++)
    {
        a[0][j] = -1;
        a[n+1][j] = -1;
    }
}

void citire()
{
    int k;
    f>>n>>m>>k;
    Starti = k/n+1;
    Startj = k%(n-1);
    chei[k] = 1;
    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=m; j++)
        {
            f>>req[i][j];
        }
    }
}

void reset()
{
    for(int i = 1; i<=n; i++)
    {
        for(int j = 1; j<=m; j++)
        {
            a[i][j] = 0;
        }
    }
}

void rez()
{
    lee();
    while(ok)
    {
        reset();
        ok = 0;
        lee();
    }
    g<<nrCam;
}

void afis()
{
    for(int i = 0; i<=n+1; i++)
    {
        for(int j = 0; j<=m+1; j++)
        {
            g<<a[i][j]<<" ";
        }
        g<<"\n";
    }
}

int main()
{
    citire();
    bordare();
    rez();
    return 0;
}