#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int inf = 1e18;
constexpr int maxn = 2e5 + 5;
constexpr int mod = 998244353;
inline void solve()
{
  int H, W; cin >> H >> W;
  vector<int> r(H), c(W);
  for (int &x : r) cin >> x;
  for (int &x : c) cin >> x;

  vector g(H, vector<int>(W));
  for (int i = 1; i < H; i ++)
    for (int j = 1; j < W; j ++)
      g[i][j] = i + j;
  
  for (int i = 1; i < H; i ++) g[i][0] = W - r[i] + i;
  for (int i = 1; i < W; i ++) g[0][i] = H - c[i] + i;
  g[0][0] = (int)1e9;
  for (int i = 0; i < H; i ++)
    for (int j = 0; j < W; j ++)
      cout << g[i][j] << " \n"[j == W - 1];
}

signed main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
  return 0;
}
/*
The details you should care:

*/