#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <unordered_set>
//#include <unordered_map>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

VV(pii) v(101);
vvint vv;
int x,y,n;
vector<pair<int,pii>> in;
vvint ans;
int cnt;
void foo(int a){
	if(a==n){
		cnt++;
		ans=vv;
		return;
	}
	int yy=in[a].S.F;
	int xx=in[a].S.S;
	int tt=in[a].F;
	rep(i,v[tt].size()){
		int ty=v[tt][i].F;
		int tx=v[tt][i].S;
		reep(j,yy-ty+1,yy+1){
			reep(k,xx-tx+1,xx+1){
				if(j<0||j+ty-1>=y||k<0||k+tx-1>=x) continue;
				bool f=true;
				reep(jj,j,j+ty){
					reep(kk,k,k+tx){
						if(vv[jj][kk]!=0&&vv[jj][kk]!=a+1){
							f=false;
						}
					}
				}
				if(f){
					reep(jj,j,j+ty){
						reep(kk,k,k+tx){
							vv[jj][kk]=a+1;
						}
					}
					foo(a+1);
					reep(jj,j,j+ty){
						reep(kk,k,k+tx){
							vv[jj][kk]=0;
						}
					}
					vv[yy][xx]=a+1;
				}
			}
		}
	}
}
void mainmain(){
	reep(i,1,11){
		reep(j,1,11){
			v[i*j].PB(pii(i,j));
			v[i*j].PB(pii(j,i));
		}
	}
	rep(i,101){
		sort(ALL(v[i]));
		v[i].erase(unique(ALL(v[i])),v[i].end());
	}
	while(cin>>x>>y>>n,x||y||n){
		in=vector<pair<int,pii>>(n);
		initvv(vv,y,x);
		rep(i,n){
			int t;
			cin>>t;
			cin>>in[t-1].F;
		}
		rep(i,y){
			rep(j,x){
				cin>>vv[i][j];
				if(vv[i][j]!=0){
					in[vv[i][j]-1].S.F=i;
					in[vv[i][j]-1].S.S=j;
				}
			}
		}
		cnt=0;
		foo(0);
		if(cnt==1){
			rep(i,ans.size()){
				rep(j,ans[i].size()){
					if(j) cout<<" ";
					cout<<ans[i][j];
				}
				cout<<endl;
			}
			continue;
		}
		else{
			cout<<"NA"<<endl;
		}
	}
}



}
int main() try{
    mainmain();
}
catch(...){
}