#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint H, W;
	cin >> H >> W;
	vi v(H), w(W);
	vin(v);
	vin(w);

	lint a=0, b=0, c=0, x, y, z;
	vvi m(H, vi(W, 1));
	m[0][0] = 2;
	repx(i, 1, H) {
		a = 2;
		repx(j, W-v[i]+1, W) {
			m[i][j] = a++;
		}
	}
	repx(j, 1, W) {
		a = 0, b = 0;
		rep(i, H) {
			if (chmax(a, m[i][j])) b++;
		}
		a = 0;
		rep(i, H) {
			chmax(a, m[i][j]);
			if (i >= H-(w[j]-b)) {
				c = a-m[i][j]+1;
				repx(k, j, W) {
					m[i][k] += c;
				}
			}
		}
	}
	rep(i, H) vout(m[i]);
}