#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int h, w; cin >> h >> w; vectorr(h), c(w); rep(i, h)cin >> r[i]; rep(i, w)cin >> c[i]; vector>ans(h, vector(w)); rep(i, h)rep(j, w) ans[i][j] = i + j + 1; rep(i, h) { if (1 == r[i])ans[i][0] = INF; else ans[i][0] = w + i - r[i]; } rep(i, w) { if (1 == c[i])ans[0][i] = INF; else ans[0][i] = h + i - c[i]; } rep(i, h) { rep(j, w) cout << ans[i][j] << " "; cout << endl; } return 0; }