#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x; i<=y; ++i)
#define repd(i,x,y) for(int i=x; i>=y; --i)

using namespace std;
typedef long long LL;
const int N=505,mod=998244353;
int n,m;
struct D{int l,r;} a[N],b[N];
LL ans[N][N];
unordered_map <int,LL> f[N][N];

int getint()
{
	char ch;
	while(!isdigit(ch=getchar()));
	int x=ch-48;
	while(isdigit(ch=getchar())) x=x*10+ch-48;
	return x;
}

struct C
{
	vector <LL> flv,inv;

	C(int n):flv(n+1,0),inv(n+1,0)
	{
		flv[0]=1;
		rep(i,1,n) flv[i]=flv[i-1]*i%mod;
		inv[n]=getmi(flv[n],mod-2);
		repd(i,n,1) inv[i-1]=inv[i]*i%mod;
	}

	LL getmi(LL a,LL x)
	{
		LL rt=1;
		while(x)
		{
			if(x&1) rt=rt*a%mod;
			a=a*a%mod,x>>=1;
		}
		return rt;
	}

	LL val(int n,int m)
	{
		return n<m?0:flv[n]*inv[m]%mod*inv[n-m]%mod;
	}
} ;

void inc(LL &x,LL y)
{
	if((x+=y)>=mod) x-=mod;
}

unordered_map <int,LL> dp(unordered_map <int,LL> &f,int x)
{
	unordered_map <int,LL> g,h;
	for(auto i:f)
	{
		inc(g[i.first],i.second);
		inc(g[i.first+x],mod-i.second);
	}
	for(auto i:g) if(i.second) h[i.first]=i.second;
	return h;
}

int main()
{
	n=getint(),m=getint();
	rep(i,1,n) a[i].l=getint(),a[i].r=getint();
	rep(i,1,m) b[i].l=getint(),b[i].r=getint();
	
	C c(250000+1000);
	f[0][0][0]=1;
	rep(i,0,n) rep(j,0,m) if(i || j)
	{
		if(i) f[i][j]=dp(f[i-1][j],a[i].r-a[i].l+1);
		else f[i][j]=dp(f[i][j-1],b[j].r-b[j].l+1);
		if(i && j)
		{
			int len=0;
			rep(x,1,i) len-=a[x].l;
			rep(x,1,j) len+=b[x].r;
			for(auto x:f[i][j]) if(x.first<=len) 
				ans[i][j]=(ans[i][j]+x.second*c.val(len-x.first+i+j-1,i+j-1))%mod;
		}
	}
	rep(i,1,n)
	{
		rep(j,1,m) printf("%lld ",ans[i][j]);
		puts("");
	}
	return 0;
}