#include <iostream>
#include <fstream>
#include <cmath>
#include <climits>
#include <vector>
#include <queue>

using namespace std;
ifstream fin("castel.in");
ofstream fout("castel.out");

long long int cnt,m,n,dx[5]={-1,0,1,0},dy[5]={0,1,0,-1},i,j,ci,cas[151][151];

queue<pair<int,int>> q;
vector<int> backpack[20000];
bool key[20000];
bool access[20000];

bool inside(int i, int j)
{
    return (i>=1 && i<=m && j>=1 && j<=m);
}

struct pos{
    int x,y;
};

pair<int, int> pozitie(int s)
{
    int i, j ;
    if(s%m==0)
    {
        i = s/m;
        j = m;
    }
    else
    {
        i = s/m+1;
        j = s%m;
    }
    return {i,j};
}

int backk(int i, int j)
{
    return m*(i-1)+j;
}


void Lee()
{
    q.push(k);
    key[k] = 1;
    access[k] = 1;
    while(!q.empty())
    {
        pair<int,int> p;
        int v = q.front();
        p = pozitie(v);
        for(int d = 0; d < 4; d++)
        {
            int iv = p.first + dx[d], jv = p.second + dy[d];
            if(inside(iv,jv))
            {
                int nr = backk(iv,jv);
                if(!key[nr])
                {
                    if(access[cas[iv][jv]==1)
                    {
                        access[nr] = 1;
                        key[nr] = 1;
                        q.push(nr);
                    }
                }
                else
                {
                    backpack[cas[iv][jv]].push_back(nr);
                }
            }
        }
        for(auto i: backpack[v])
        {
            if(!key[i])
            {
                q.push(i);
                key[i] = 1;
                access[i] = 1;
            }
        }
        q.pop();
    }
}

void citire()
{
    fin>>m>>n>>ci;
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
        {
            fin>>cas[i][j];
        }
    }
}



int main()
{
    citire();
    Lee();
    cnt = 0;
    for(i=1;i<=n*m;i++)
    {
        if(access[i])
            cnt++;
    }
    fout<<cnt;
}