#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
inline int Mod(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return Mod(x + y - mod); }
inline int sub(int x, int y) { return Mod(x - y); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
const int maxn = 500;
int l[maxn + 5], r[maxn + 5], L[maxn + 5], R[maxn + 5];
int f[maxn + 5][maxn + 5][2 * maxn + 5];
inline int q(int i, int j, int l, int r) {
	if (j < 0 || l > r) return 0;
	return sub(f[i][j][r], f[i][j][l - 1]);
} 
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d%d", &l[i], &r[i]);
	for (int i = 1; i <= m; i++) scanf("%d%d", &L[i], &R[i]);
	fill(f[0][0] + 501, f[0][0] + 1002, 1);
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= m; j++)
			for (int k = 1; k <= 1001; k++) {
				f[i][j][k] = add(q(i - 1, j, k - r[i], min(k - l[i], 501)), q(i, j - 1, max(k + L[j], 502), k + R[j]));
				if (j && k == 501) printf("%d ", f[i][j][k]);
				f[i][j][k] = add(f[i][j][k], f[i][j][k - 1]);
			}
		puts("");
	}
}