#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

int main(){
  int W, H, N; 
  while (scanf("%d %d %d", &W, &H, &N) != EOF && (W|H|N)) {
    REP(i, N) {
      int f, v;
      scanf("%d %d", &f, &v);
    }
    vector<bool> exist(N, false);
    REP(y, H) {
      REP(x, W) {
        int t;
        scanf("%d", &t);
        if(t > 0) exist[t - 1] = true;
      }
    }
    REP(i, N) assert(exist[i]);
  }
  return 0;
}