#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int s=0,z=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')z=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		s=(s<<3)+(s<<1)+(c^48);
		c=getchar();
	}
	return s*z;
}
const int N = 505;
const int mod = 998244353;
int n,m;
long long f[N][N][N*2];
int la[N],lb[N],ra[N],rb[N];
int main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++){
		la[i]=read(),ra[i]=read();
	}	
	for(int i=1;i<=m;i++){
		lb[i]=read(),rb[i]=read();
	}
	f[0][0][501]=1;
	for(int i=501;i<=1001;i++) f[0][0][i]=1;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=m;j++){
			if(!i&&!j) continue;
			for(int k=1;k<=1001;k++){
				if(i!=0)f[i][j][k]=f[i-1][j][min(max(0,k-la[i]),501)]-f[i-1][j][min(max(0,k-ra[i]-1),501)];
				if(j!=0)f[i][j][k]+=f[i][j-1][max(min(1001,k+rb[j]),501)]-f[i][j-1][max(min(1001,k+lb[j]-1),501)];
				f[i][j][k]=(f[i][j][k]%mod+mod)%mod;
				f[i][j][k]=(f[i][j][k]+f[i][j][k-1])%mod;
				
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int l=1;l<=m;l++){
			cout<<f[i][l][501]-f[i][l][500]<<" ";
		}
		cout<<"\n";
	}
	return 0;
}