#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int h, w; cin >> h >> w;
  vector<int> r(h), c(w);
  REP(i, h) cin >> r[i];
  REP(j, w) cin >> c[j];
  vector a(h, vector(w, 1000000000));
  FOR(i, 1, h) FOR(j, 1, w) a[i][j] = i + j - 1;
  FOR(i, 1, h) a[i][0] = (r[i] == w ? 1 : a[i][w - r[i]]);
  FOR(j, 1, w) a[0][j] = (c[j] == h ? 1 : a[h - c[j]][j]);
  REP(i, h) REP(j, w) cout << a[i][j] << " \n"[j + 1 == w];
  return 0;
}