#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD = 998244353;
const int N = 510;
int n,m;
ll f[N][N*2+10],sum[N][N*2+10],ans[N][N];
int l[2][N],r[2][N];
int main(){
	scanf("%d%d", &n, &m);
	for(int i=1;i<=n;i++)scanf("%d%d", &l[0][i], &r[0][i]);
	for(int i=1;i<=m;i++)scanf("%d%d", &l[1][i], &r[1][i]);
	for(int i=0;i<=500;i++)sum[0][i+N]=1;
	for(int len=1;len<=n+m;len++){
		memset(f,0,sizeof(f));
		for(int i=max(0,len-m),j=len-i;i<=n&&~j;i++,j--){
			for(int v=-500;v<=500;v++){
				if(v>0&&i)
					f[i][v+N]=(sum[i-1][v+N-l[0][i]]-sum[i-1][v+N-r[0][i]-1]+MOD)%MOD;
				else if(j)
					f[i][v+N]=(sum[i][v+N+r[1][j]]-sum[i][v+N+l[1][j]-1]+MOD)%MOD;
			}
			ans[i][j]=f[i][N];
		}
		memset(sum,0,sizeof(sum));	
		for(int i=max(0,len-m),j=len-i;i<=n&&~j;i++,j--)
			for(int v=-500;v<=500;v++)
				sum[i][v+N]=(sum[i][v+N-1]+f[i][v+N])%MOD;		
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)printf("%lld ", ans[i][j]);
		putchar('\n');
	}
		
	return 0;
}