#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 505, MAXV = 1020, MOD = 998244353, ADD = 505;
int n, m, lx[MAXN], rx[MAXN], ly[MAXN], ry[MAXN];
ll dp[MAXN][MAXN][MAXV];
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d", &lx[i], &rx[i]);
	}
	for (int i = 1; i <= m; i++) {
		scanf("%d %d", &ly[i], &ry[i]);
	}
	dp[0][0][ADD] = 1;
	dp[0][0][ADD + 1] = MOD - 1;
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= m; j++) {
			for (int ii = 0; ii + 1 < MAXV; ii++) {
				(dp[i][j][ii + 1] += dp[i][j][ii]) %= MOD;
				if (ii <= ADD && i + 1 <= n) {
					// ii + lx[i + 1] ~ ii + rx[i + 1]
					(dp[i + 1][j][ii + lx[i + 1]] += dp[i][j][ii]) %= MOD;
					(dp[i + 1][j][ii + rx[i + 1] + 1] += MOD - dp[i][j][ii]) %= MOD;
				} else if (ii > ADD && j + 1 <= m) {
					// ii - ry[j + 1] ~ ii - ly[j + 1]
					(dp[i][j + 1][ii - ry[j + 1]] += dp[i][j][ii]) %= MOD;
					(dp[i][j + 1][ii - ly[j + 1] + 1] += MOD - dp[i][j][ii]) %= MOD;
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			printf("%lld ", dp[i][j][ADD]);
		}
		printf("\n");
	}
	return 0;
}