#include <bits/stdc++.h>

using namespace std;

const int N = 510, MOD = 998244353, V = 10;

int n, m, l[N], r[N], s[N], t[N], ans[N][N];
int dp[N][N << 1], nxt[N][N << 1];

signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> l[i] >> r[i];
	for (int j = 1; j <= m; j++) cin >> s[j] >> t[j];
	dp[0][0 + V] = 1;
	for (int sum = 0; sum < n + m; sum++)
	{
		for (int i = 0; i <= sum; i++)
		{
			int j = sum - i;
			for (int d = -V; d <= V; d++)
			{
				int v = dp[i][d + V];
				if (!v) continue;
//				printf("***%d %d\n", d - t[j + 1] + V, d - s[j + 1] + 1 + V);
				if (d < 0) (nxt[i + 1][d + l[i + 1] + V] += v) %= MOD, (nxt[i + 1][d + r[i + 1] + 1 + V] -= v) %= MOD;
				else (nxt[i][d - t[j + 1] + V] += v) %= MOD, (nxt[i][d - s[j + 1] + 1 + V] -= v) %= MOD;
			}
		}
		for (int i = 0; i <= sum; i++)
		{
			int j = sum + 1 - i;
			dp[i][-V + V] = nxt[i][-V + V];
			for (int d = -V + 1; d <= V; d++) (dp[i][d + V] = dp[i][d - 1 + V] + nxt[i][d + V]) %= MOD;//, printf("dp(%d, %d, %d) = %d\n", i, j, d, dp[i][d + V]);
			ans[i][j] = dp[i][0 + V];
		}
		for (int i = 0; i <= sum; i++)
			for (int d = -V; d <= V; d++) nxt[i][d + V] = 0;
	}
	for (int a = 1; a <= n; a++, cout << '\n')
		for (int b = 1; b <= m; b++)
			cout << ans[a][b] << ' ';
}