#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<60;
double pi=3.141592653589793238462643383279L;
double eps=1e-9;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,m;cin>>n>>m;
    int a[n],b[m];
    rep(i,0,n)cin>>a[i];
    rep(i,0,m)cin>>b[i];
    sort(a,a+n);
    sort(b,b+m);
    int ans[n][m];
    int cnt[n*m];
    fill(cnt,cnt+n*m,0);
    vector<int> v[n*m];
    rep(i,0,n){
        rep(j,1,a[i]){
            int num=i*m+j;
            cnt[num]++;
            v[num-1].push_back(num);
        }
        rep(j,a[i]-1,m-1){
            int num=i*m+j;
            cnt[num]++;
            v[num+1].push_back(num);
        }
    }
    rep(i,0,m){
        rep(j,1,b[i]){
            int num=j*m+i;
            cnt[num]++;
            v[num-m].push_back(num);
        }
        rep(j,b[i]-1,n-1){
            int num=j*m+i;
            cnt[num]++;
            v[num+m].push_back(num);
        }
    }
    queue<int> q;
    int num=0;
    rep(i,0,n*m){
        if(cnt[i]==0){
            q.push(i);
        }
    }
    while(q.size()>0){
        int now=q.front();q.pop();
        num++;
        ans[now/m][now%m]=num;
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            cnt[ne]--;
            if(cnt[ne]==0)q.push(ne);
        }
    }
    rep(i,0,n){
        rep(j,0,m)cout<<ans[i][j]<<" ";
        cout<<endl;
    }
}