#include <bits/stdc++.h>
using namespace std;

struct TopologicalSort{
    vector<int> rank;
    vector<int> ordered_indices;
    bool valid;

    TopologicalSort(int N, vector<int> G[]){
        rank.resize(N, -1);
        ordered_indices.resize(N, -1);

        vector<int> indeg(N, 0);
        for(int i=0; i<N; i++) for(int j : G[i]) indeg[j]++;
        stack<int> st;
        for(int i=0; i<N; i++) if(indeg[i] == 0) st.push(i);

        int num = 0;
        while(st.size()){
            int i = st.top(); st.pop();
            rank[i] = num;
            ordered_indices[num] = i;
            num++;
            for(int j : G[i]){
                indeg[j]--;
                if(indeg[j] == 0) st.push(j);
            }
        }
        // 閉路があるとfalse
        valid = (num == N);
    }
};

int main(){
    int H, W, A[400], B[400];
    cin >> H >> W;
    for(int i=0; i<H; i++) cin >> A[i];
    for(int i=0; i<W; i++) cin >> B[i];
    sort(A, A+H);
    sort(B, B+W);

    vector<int> edges[400*400];
    for(int i=0; i<H; i++) for(int j=0; j<W; j++){
        if(i){
            int from = (i-1)*W + j, to = i*W + j;
            if(B[j] <= i) swap(from, to);
            edges[from].push_back(to);
        }
        if(j){
            int from = i*W + j - 1, to = i*W + j;
            if(A[i] <= j) swap(from, to);
            edges[from].push_back(to);
        }
    }

    TopologicalSort ts(H*W, edges);
    assert(ts.valid);
    for(int i=0; i<H; i++) for(int j=0; j<W; j++) cout << ts.rank[i*W+j]+1 << " \n"[j==W-1];
    return 0;
}