#include<bits/stdc++.h>
#define int long long
using namespace std;
const int p=998244353;
const int N=510;
int n,m,dp[N][N][N<<1],a[N],b[N],c[N],d[N];
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i]>>b[i];
	}
	for(int i=1;i<=m;i++)
	{
		cin>>c[i]>>d[i];
	}
	dp[0][0][500]=1;
	dp[0][0][501]=p-1;
	for(int i=0;i<=n;i++)
	{
		for(int j=0;j<=m;j++)
		{
			for(int k=0;k<=1000;k++)
			{
				dp[i][j][k+1]=(dp[i][j][k+1]+dp[i][j][k])%p;
				if(k<=500)
				{
					dp[i+1][j][k+a[i+1]]=(dp[i+1][j][k+a[i+1]]+dp[i][j][k])%p;
					dp[i+1][j][k+1+b[i+1]]=(dp[i+1][j][k+1+b[i+1]]-dp[i][j][k]+p)%p;
				}
				else
				{
					dp[i][j+1][k-d[j+1]]=(dp[i][j+1][k-d[j+1]]+dp[i][j][k])%p;
					dp[i][j+1][k+1-c[j+1]]=(dp[i][j+1][k+1-c[j+1]]-dp[i][j][k]+p)%p;
				}
			}
			if(i&&j)
			{
				cout<<dp[i][j][500]<<' ';
			}
		}
		cout<<'\n';
	}
	cout<<flush;
	return 0;
}