#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int H,W;
int R[505];
int C[505];
int A[505][505];

vector<int> E[505][505];
int in[505][505];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>H>>W;
	FOR(y,H) {
		cin>>R[y];
		FOR(x,R[y]-1) {
			E[y][x].push_back(y*500+x+1);
			in[y][x+1]++;
		}
	}
	FOR(x,W) {
		cin>>C[x];
		FOR(y,C[x]-1) {
			E[y][x].push_back(y*500+500+x);
			in[y+1][x]++;
		}
	}
	queue<int> Q;
	for(x=W-1;x>=0;x--) for(y=H-1;y>=0;y--) if(in[y][x]==0) Q.push(y*500+x);
	int cur=1;
	while(Q.size()) {
		y=Q.front()/500;
		x=Q.front()%500;
		Q.pop();
		A[y][x]=cur++;
		FORR(e,E[y][x]) if(--in[e/500][e%500]==0) Q.push(e);
	}
	FOR(y,H) {
		FOR(x,W) cout<<A[y][x]<<" ";
		cout<<endl;
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}