#include <bits/stdc++.h>
#define _for(i, a, b) for (int i = a; i <= b; ++i)
#define for_(i, a, b) for (int i = a; i >= b; --i)
#define far(i, vec) for (auto i : vec)
#define bdmd int mid = (l + r) >> 1
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef std::pair <int, int> pii;
typedef std::pair <ll, ll> pll;
const int N = 510, V = 500, P = 998244353;
namespace IO {
	int rnt () {
		int x = 0, w = 1; char c = getchar ();
		while (!isdigit (c)) { if (c == '-') w = -1; c = getchar (); }
		while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
		return x * w;
	}
}
namespace SOLVE {
	using namespace IO;
	int n, m, lx[N], rx[N], ly[N], ry[N];
	int F[N][N][N * 2], sum[N][N][N * 2];
	void In () {
		n = rnt (), m = rnt ();
		_for (i, 1, n) lx[i] = rnt (), rx[i] = rnt ();
		_for (i, 1, m) ly[i] = rnt (), ry[i] = rnt ();
		return;
	}
	void Solve () {
		F[0][0][N] = 1;
		_for (x, -V, -1) sum[0][0][x + N] = 0;
		_for (x, 0, V) sum[0][0][x + N] = 1;
		_for (S, 1, n + m) {
			_for (i, std::max (0, S - m), std::min (S, n)) {
				int j = S - i;
				_for (x, -V, V) {
					if (i) {
						int R = std::min (0, x - lx[i]) + N;
						int L = std::max (-V, x - rx[i]) + N - 1;
						_for (y, x - rx[i], std::min (0, x - lx[i]))
							F[i][j][x + N] = (F[i][j][x + N] + F[i - 1][j][y + N]) % P;
						if (L <= R)
							F[i][j][x + N] = (sum[i - 1][j][R] - sum[i - 1][j][L] + P) % P;
					}
					if (j) {
						int R = std::min (V, x + ry[j]) + N;
						int L = std::max (1, x + ly[j]) + N - 1;
						if (L <= R)
							F[i][j][x + N] = (F[i][j][x + N] + (sum[i][j - 1][R] - sum[i][j - 1][L] + P) % P) % P;
					}
					sum[i][j][x + N] = (sum[i][j][x - 1 + N] + F[i][j][x + N]) % P;
				}
			}
		}
		return;
	}
	void Out () {
		_for (i, 1, n) {
			_for (j, 1, m)
				printf ("%d ", F[i][j][N]);
			puts ("");
		}
		return;
	}
}
int main () {
	SOLVE::In ();
	SOLVE::Solve ();
	SOLVE::Out ();
	return 0;
} /*

*/