#include <cstdio>

#include <queue>


using namespace std;


int a[155][150], fr[22503];

int n, m, k;

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

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

int nr=1;


queue < pair <int, int> > Q;


void afis()

{

    for(int i=0; i<=n+1; i++)

    {

        for(int j=0; j<=m+1; j++)

        {

            printf("%d ", a[i][j]);

        }

        printf("\n");

    }

    printf("\n");

}



void border()

{

    for(int i=1; i<=n; 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;

    }

}



int lee(int k)

{

    int x=(k-1)/m+1;

    int y=(k-1)%m+1;

    a[x][y]=-1;

    fr[k]=1;

    Q.push(make_pair(x, y));

    int ok=0;

    while(!Q.empty())
    {

        //pair<int, int> p = Q.front();
        int i=Q.front().first;
        int j=Q.front().second;

        Q.pop();

        for(int k=0; k<4; k++)
        {
            int iv=i+di[k];
            int jv=j+dj[k];

            int camera=(iv-1)*m+(jv);

            if(a[iv][jv] != -1 && fr[a[iv][jv]]>0)
            {
                if(fr[camera] == 0)
                {
                    ok=1;
                    fr[camera]=1;
                    nr++;

                }
                a[iv][jv]=-1;

                Q.push(make_pair(iv, jv));
                continue;
            }
        }
    }
    return ok;
}

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


int main()

{


    freopen("castel.in", "r", stdin);

    freopen("castel.out", "w", stdout);


    scanf("%d %d %d", &n, &m, &k);


    for(int i=1; i<=n; i++)

    {

        for(int j=1; j<=m; j++)

        {

            scanf("%d", &a[i][j]);

        }

    }

    fr[0]=1;

    border();

//afis();

    while(lee(k))

    {

//afis();

        reset();

    }


    printf("%d", nr);

    return 0;

}