#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
typedef pair<int, int> pii;
typedef vector<int> vi;
template<class X, class Y> X cmx(X &a, Y b) { a = max<X>(a, b); }
#define ary(k) array<int, k>
int n,k,h,a[200][200],p[1<<20],q[1<<20],f[30][200][200],x,y,A,w[1<<20],X[]={0,-1,0,0,1},Y[]={0,0,-1,1,0};
void Z(){
    cin>>n>>k>>h;
    if(n==0&&k==0&&h==0)
        exit(0);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            cin>>a[i][j];
    for(int i=1;i<=k;i++)
        cin>>p[i]>>q[i];
    for(int i=1;i<=h;i++)
        cin>>w[i];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f[h][i][j]=a[i][j]>w[h];
    for(int k=h-1;~k;k--)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++){
                f[k][i][j]=0;
                if(a[i][j]<=w[k])
                    continue;
                for(int l=0;l<5;l++)
                    f[k][i][j]|=1<=(x=i+X[l])&&x<=n&&1<=(y=j+Y[l])&&y<=n&&f[k+1][x][y];
            }
    A=0;
    for(int i=1;i<=k;i++)
        A+=f[0][p[i]][q[i]];
    cout<<A<<'\n';
}
signed main() {
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    while(1)
        Z();
}