#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<60;
const ll Mod=998244353;
const ll MAX_V=400*400;

int V;
vector<int> G[MAX_V];
vector<int> rG[MAX_V];
vector<int> vs;
bool used[MAX_V];
int cmp[MAX_V];

void addedge(int from,int to){
    G[from].push_back(to);
    rG[to].push_back(from);
}

void dfs(int v){
    used[v]=true;
    for(int i=0;i<G[v].size();i++){
        if(!used[G[v][i]]) dfs(G[v][i]);
    }
    vs.push_back(v);
}

void rdfs(int v,int k){
    used[v]=true;
    cmp[v]=k;
    for(int i=0;i<rG[v].size();i++){
        if(!used[rG[v][i]]) rdfs(rG[v][i],k);
    }
}

int scc(){
    memset(used,0,sizeof(used));
    vs.clear();
    for(int v=0;v<V;v++){
        if(!used[v]) dfs(v);
    }
    memset(used,0,sizeof(used));
    int k=0;
    for(int i=vs.size()-1;i>=0;i--){
        if(!used[vs[i]]) rdfs(vs[i],k++);
    }
    return k;
}

int main(){
  int i,j;
  int h,w;
  cin>>h>>w;
  V=h*w;
  int a[h],b[w];
  for(i=0;i<h;i++) cin>>a[i];
  for(i=0;i<w;i++) cin>>b[i];
  sort(a,a+h);
  sort(b,b+w);
  for(i=0;i<h;i++){
    for(j=1;j<w;j++){
      if(j<a[i]) addedge(j*h+i-j,j*h+i);
      else addedge(j*h+i,j*h+i-j);
    }
  }
  for(j=0;j<w;j++){
    for(i=1;i<h;i++){
      if(i<b[j]) addedge(j*h+i-1,j*h+i);
      else addedge(j*h+i,j*h+i-1);
    }
  }
  scc();
  //for(i=0;i<h;i++) cout<<a[i]<<endl;
  //cout<<endl;
  //for(j=0;j<w;j++) cout<<b[j]<<endl;
  for(i=0;i<h;i++){
    for(j=0;j<w;j++){
      cout<<cmp[j*h+i]+1<<" ";
    }
    cout<<endl;
  }
}