#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

bool topological_sort(vector<vector<int>> g, vector<int> &order){
    int n = g.size();
    order.clear();
    vector<bool> used(n, false);
    function<void(int)> dfs = [&](int v){
        used[v] = true;
        for(int to : g[v]){
            if(!used[to]) dfs(to);
        }
        order.push_back(v);
    };
    for(int v = 0; v < n; v++){
        if(!used[v]) dfs(v);
    }
    reverse(order.begin(), order.end());
    vector<int> inv_order(n);
    for(int i = 0; i < n; i++) inv_order[order[i]] = i;
    for(int v = 0; v < n; v++){
        for(int u : g[v]){
            if(inv_order[v] > inv_order[u]) return false;
        }
    }
    return true;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int h, w; cin >> h >> w;
    vector<int> a(h), b(w);
    for(int i = 0; i < h; i++) cin >> a[i];
    for(int i = 0; i < w; i++) cin >> b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    auto to_idx = [&](int i, int j){
        return i*w+j;
    };
    vector<vector<int>> g(h*w);
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            if(i+1 < h){
                if(h-1-b[j] <= i){
                    g[to_idx(i, j)].push_back(to_idx(i+1, j));
                }else{
                    g[to_idx(i+1, j)].push_back(to_idx(i, j));
                }
            }
            if(j+1 < w){
                if(w-1-a[i] <= j){
                    g[to_idx(i, j)].push_back(to_idx(i, j+1));
                }else{
                    g[to_idx(i, j+1)].push_back(to_idx(i, j));
                }
            }
        }
    }
    vector<int> ord;
    assert(topological_sort(g, ord));
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            cout << ord[to_idx(i, j)]+1 << ' ';
        }
        cout << endl;
    }
}