#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
const int N=505;
inline ll read(){
	ll x=0;char f=1,c=getchar();
	while(c<48||c>57){if(c=='-')f=0;c=getchar();}
	while(c>=48&&c<=57){x=(x<<1)+(x<<3)+ll(c)-48;c=getchar();}
	return f==1?x:-x;
}
inline void upd(int&x,int y){if((x=x+y)>=mod)x=x-mod;}
struct Node{
	int n,l[N],r[N];
	int suml[N],sumr[N],dp[N][N*N];
	void sol(){
		dp[0][0]=1,suml[0]=sumr[0]=0;
		for(int i=1;i<=n;++i){
			l[i]=read(),r[i]=read();
			suml[i]=suml[i-1]+l[i],sumr[i]=sumr[i-1]+r[i];
			for(int j=l[i];j<=r[i];++j){
				for(int k=suml[i];k<=sumr[i];++k){
					upd(dp[i][k],dp[i-1][k-j]);
				}
			}
		}
	}
}x,y;
int solve(){
	x.n=read(),y.n=read();
	x.sol(),y.sol();
	for(int i=1;i<=x.n;++i){
		for(int j=1;j<=y.n;++j){
			ll res=0;
			for(int k=max(x.suml[i],y.suml[j]),mn=min(x.sumr[i],y.sumr[i]);k<=mn;++k){
				res=(res+1ll*x.dp[i][k]*y.dp[j][k]%mod)%mod;
			}
			printf("%lld ",res);
		}
		printf("\n");
	}
	return 0;
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int T=1;
	while(T--){
		solve();
		if(T!=0)printf("\n");
	}
	fclose(stdin),fclose(stdout);
	return 0;
}