#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>

void out(int k) {
    cout << k%2 << " ";
    k /= 2;
    cout << k/9 << " " << k/3%3 << " " << k%3 << "  ";
}

struct Dinic {
    struct Edge {
        int to, rev;
        ll c, oc;
        ll flow() { return max(oc - c, 0LL);}
    };
    vi lvl, ptr, q;
    vector<vector<Edge>> adj;
    Dinic(int n) : lvl(n), ptr(n), q(n), adj(n) {}
    void addEdge(int a, int b, ll c, ll rcap = 0) {
//        out(a); out(b); cout << "\n";
        adj[a].push_back({b, sz(adj[b]), c, c});
        adj[b].push_back({a, sz(adj[a])-1, rcap, rcap});
    }
    ll dfs(int v, int t, ll f) {
        if (v == t || !f) return f;
        for (int &i = ptr[v]; i < sz(adj[v]); i++) {
            Edge &e = adj[v][i];
            if (lvl[e.to] == lvl[v] + 1)
                if (ll p = dfs(e.to, t, min(f, e.c))) {
                    e.c -= p, adj[e.to][e.rev].c += p;
                    return p;
                }
        }
        return 0;
    }
    ll calc(int s, int t) {
        ll flow = 0; q[0] = s;
        rep(L,0,31) do {
                lvl=ptr=vi(sz(q));
                int qi = 0, qe = lvl[s] = 1;
                while (qi < qe && !lvl[t]) {
                    int v = q[qi++];
                    for (Edge e : adj[v])
                        if (!lvl[e.to] && e.c >> (30 - L))
                            q[qe++] = e.to, lvl[e.to] = lvl[v] + 1;
                }
                while (ll p = dfs(s, t, LLONG_MAX)) flow += p;
            } while (lvl[t]);
        return flow;
    }
    bool leftOfMinCut(int a) {return lvl[a] != 0;}
};

int height[102][102];
int flood[25];

int dirx[5] = {0, 0, 1, 0, -1};
int diry[5] = {0, 1, 0, -1, 0};

signed main() {
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    while (true) {
        int n, m, h;
        cin >> n >> m >> h;
        if (n == 0 && m == 0 && h == 0) {
            break;
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                cin >> height[i][j];
            }
        }
        int source = n*n*(h+1)*2, sink = n*n*(h+1)*2+1;
        Dinic dinic(sink+1);
        for (int i = 0; i < m; i++) {
            int x, y;
            cin >> x >> y;
            dinic.addEdge(source, (x*n+y)*2, 1);
        }
        flood[0] = -1;
        for (int k = 1; k <= h; k++) {
            cin >> flood[k];
        }
        for (int k = 0; k <= h; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    int cur = (k*n*n+n*i+j)*2;
                    if (flood[k] < height[i][j])
                        dinic.addEdge(cur, cur+1, 1);
                    if (k == h) {
                        dinic.addEdge(cur+1, sink, 1);
                        continue;
                    }
                    for (int hh = 0; hh < 5; hh++) {
                        int ni = i + dirx[hh], nj = j + diry[hh];
                        if (ni < 0 || ni >= n || nj < 0 || nj >= n)
                            continue;
                        int nast = ((k+1)*n*n+n*ni+nj)*2;
                        dinic.addEdge(cur+1, nast, 1);
                    }
                }
            }
        }
        cout << dinic.calc(source, sink) << "\n";
    }
}