#include<bits/stdc++.h>
#define M 505
#define K 500
#define mod 998244353
using namespace std;
int n, l[M], r[M], m, L[M], R[M], dp[M][M][1005];
int main()
{
	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]);
	dp[0][0][500] = 1;
	dp[0][0][501] = -1;
	for(int i = 0; i <= n; i++) for(int j = 0; j <= m; j++)
	{
		for(int k = -499; k <= 500; k++) (dp[i][j][k + K] += dp[i][j][k - 1 + K]) %= mod;
		for(int k = -500; k <= 500; k++) if(dp[i][j][k + K])
		{
			if(k >= 0 && j < m)
			{
				(dp[i][j + 1][k + K - R[j + 1]] += dp[i][j][k + K]) %= mod;
				(dp[i][j + 1][k + K - L[j + 1] + 1] -= dp[i][j][k + K]) %= mod;
			}
			if(k < 0 && i < n)
			{
				(dp[i + 1][j][k + K + l[i + 1]] += dp[i][j][k + K]) %= mod;
				(dp[i + 1][j][k + K + r[i + 1] + 1] -= dp[i][j][k + K]) %= mod;
			}
		}
	}
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= m; j++) printf("%d ", dp[i][j][500]);
		puts("");
	} 
	return 0;
}