#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 500;
const ll mod = 998244353;
int n,m,lx[N + 5],rx[N + 5],ly[N + 5],ry[N + 5];
int dp[2][N + 5][2 * N + 5];
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][N] = 1;dp[0][0][N + 1] = mod - 1;
	for(int i = 0;i <= n;i++)
	{
		int o = i & 1;
		for(int j = 0;j <= m;j++)
			for(int k = 0;k <= 2 * N;k++)
				dp[o ^ 1][j][k] = 0;
		for(int j = 0;j <= m;j++)
		{
			for(int k = 1;k <= 2 * N;k++)
				(dp[o][j][k] += dp[o][j][k - 1]) %= mod;
			for(int k = 1;k <= 2 * N;k++)
			{
				ll val = dp[o][j][k];
				if(!val)continue;
				if(j != m&&k >= N)
					(dp[o][j + 1][k - ry[j + 1]] += val) %= mod,
					(dp[o][j + 1][k - ly[j + 1] + 1] += mod - val) %= mod;
				if(i != n&&k < N)
					(dp[o ^ 1][j][k + lx[i + 1]] += val) %= mod,
					(dp[o ^ 1][j][k + rx[i + 1] + 1] += mod - val) %= mod;
			}
			if(i&&j)cout<<dp[o][j][N]<<" ";
		}
		if(i)puts("");
	}
}