#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

int scc(const VV<>& g, V<>& comp) {
  int n = g.size();
  VV<> rg(n);
  for (int v = 0; v < n; v++) for (int w : g[v]) {
    rg[w].push_back(v);
  }
  V<> vs;
  V<bool> vis(n);
  comp.resize(n);
  auto dfs = [&](const auto& dfs, int v) -> void {
    vis[v] = true;
    for (int w : g[v]) if (!vis[w]) {
      dfs(dfs, w);
    }
    vs.push_back(v);
  };
  auto rdfs = [&](const auto& rdfs, int v, int k) -> void {
    vis[v] = true;
    comp[v] = k;
    for (int w : rg[v]) if (!vis[w]) {
      rdfs(rdfs, w, k);
    }
  };
  for (int v = 0; v < n; v++) if (!vis[v]) {
    dfs(dfs, v);
  }
  vis.assign(n, false);
  int k = 0;
  reverse(begin(vs), end(vs));
  for (int v : vs) if (!vis[v]) {
    rdfs(rdfs, v, k++);
  }
  return k;
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int h, w; cin >> h >> w;
  V<> a(h); for (auto&& e : a) cin >> e;
  V<> b(w); for (auto&& e : b) cin >> e;
  sort(rbegin(a), rend(a));
  sort(rbegin(b), rend(b));
  auto _ = [&](int i, int j) -> int { return i * w + j; };
  VV<> g(h * w);
  for (int i = 0; i < h; ++i) {
    for (int j = w - a[i]; j < w - 1; ++j) {
      g[_(i, j)].push_back(_(i, j + 1));
    }
    if (w - a[i]) {
      g[_(i, w - 1)].push_back(_(i, w - a[i] - 1));
    }
    for (int j = w - a[i] - 1; j >= 1; --j) {
      g[_(i, j)].push_back(_(i, j - 1));
    }
  }
  for (int j = 0; j < w; ++j) {
    for (int i = h - b[j]; i < h - 1; ++i) {
      g[_(i, j)].push_back(_(i + 1, j));
    }
    if (h - b[j]) {
      g[_(h - 1, j)].push_back(_(h - b[j] - 1, j));
    }
    for (int i = h - b[j] - 1; i >= 1; --i) {
      g[_(i, j)].push_back(_(i - 1, j));
    }
  }
  V<> comp;
  int k = scc(g, comp);
  cerr << "k = " << k << " (l." << __LINE__ << ")\n";
  for (int i = 0; i < h; ++i) for (int j = 0; j < w; ++j) {
    cout << comp[_(i, j)] + 1 << " \n"[j == w - 1];
  }
}