#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define rep2r(i, l, r) for (int i = (r) - 1; i >= (l); i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int H, W; cin >> H >> W;
  vector<int> A(H); rep(i, H) cin >> A[i];
  vector<int> B(W); rep(i, W) cin >> B[i];
  vector<vector<int>> g(H * W);
  auto index = [&](int i, int j) { return i * W + j; };
  rep(i, H) {
    if (A[i] == 1) {
      repr(j, W - 1) g[index(i, j + 1)].push_back(index(i, j));
    } else {
      rep(j, A[i] - 2) g[index(i, j)].push_back(index(i, j + 1));
      g[index(i, A[i] - 2)].push_back(index(i, W - 1));
      rep2r(j, A[i] - 1, W - 1) g[index(i, j + 1)].push_back(index(i, j));
    }
  }
  rep(j, W) {
    if (B[j] == 1) {
      repr(i, H - 1) g[index(i + 1, j)].push_back(index(i, j));
    } else {
      rep(i, B[j] - 2) g[index(i, j)].push_back(index(i + 1, j));
      g[index(B[j] - 2, j)].push_back(index(H - 1, j));
      rep2r(i, B[j] - 1, H - 1) g[index(i + 1, j)].push_back(index(i, j));
    }
  }
  vector<int> ans(H * W, -1);
  int now = H * W;
  auto dfs = [&](auto dfs, int u) -> void {
    for (int v : g[u]) {
      if (ans[v] == -1) {
        dfs(dfs, v);
      }
    }
    ans[u] = now--;
  };
  rep(i, H * W) if (ans[i] == -1) dfs(dfs, i);
  rep(i, H) rep(j, W) cout << ans[index(i, j)] << " \n"[j == W - 1];
}