#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

int main(){
	
	int H,W,N;
	cin>>H>>W>>N;
	
	vector A(H,vector<int>(W));
	rep(i,H){
		rep(j,W){
			scanf("%d",&A[i][j]);
			A[i][j]--;
		}
	}
	vector<vector<int>> E(N);
	vector dx = {0,0,1,-1},dy = {1,-1,0,0};
	
	vector<bool> ok(N-1,true);
	
	rep(i,H){
		rep(j,W){
			rep(k,4){
				int ii = i+dx[k],jj = j+dy[k];
				if(ii<0||ii>=H||jj<0||jj>=W)continue;
				
				if(A[i][j] != A[ii][jj]){
					E[A[i][j]].push_back(A[ii][jj]);
				}
			}
		}
	}
	
	dsu D(N);
	rep(i,N){
		if(i==0)continue;
		bool f = true;
		rep(j,E[i].size()){
			if(D.same(E[i][j],i-1)){
				f = false;
				break;
			}
		}
		if(f)D.merge(i,i-1);
	}
	
	int ans = 0;
	rep(i,N){
		if(D.leader(i)==i)ans++;
	}
	
	cout<<ans<<endl;
	
	return 0;
}