#include <fstream>
#include <vector>
#define NMax 151
using namespace std;
ifstream f("castel.in");
ofstream g("castel.out");
int m, n, k, mat[NMax][NMax], viz[NMax][NMax], qu[2][NMax*NMax], i, j, p, u, x, y, l, c, nrc=1, chei[NMax*NMax], oc[NMax*NMax];
vector<pair<int,int> > nedes[NMax*NMax];
const int dx[]={0, -1, 0, 1, 0}, dy[]={0, 0, 1, 0, -1};
int main() {
    f>>m>>n>>k;
    for (i=1; i<=m; i++)
        for (j=1; j<=n; j++)
            f>>mat[i][j];
    if (k%n==0)
        x=k/n;
    else
        x=k/n+1;
    y=k-(x-1)*n;
    viz[x][y]=1;
    p=u=1;
    qu[0][p]=x;
    qu[1][p]=y;
    chei[(x-1)*n+y]=1;
    while (p<=u) {
        for (i=1; i<=4; i++) {
            l=dx[i]+qu[0][p];
            c=dy[i]+qu[1][p];
            if (viz[l][c]==0 && l>=1 && l<=m && c>=1 && c<=n) {
                viz[l][c]=1;
                if (chei[mat[l][c]]) {
                    u++;
                    qu[0][u]=l;
                    qu[1][u]=c;
                    nrc++;
                    int codif=(l-1)*n+c;
                    chei[codif]=1;
                    if (!nedes[codif].empty()) {
                        nrc+=nedes[codif].size();
                        oc[codif]=1;
                        for (i=0; i<nedes[codif].size(); i++)
                            chei[(nedes[codif][i].first-1) * n + nedes[codif][i].second ]=1;
                    }
                }
                else
                    nedes[mat[l][c]].push_back(make_pair(l, c));
            }
        }
        p++;
    }
    for (i=1; i<=n*m; i++)
        if (!nedes[i].empty() && chei[i] && !oc[i])
            nrc+=nedes[i].size();
    g<<nrc;
    return 0;
}