#include<bits/stdc++.h>
#define LL long long
#define P pair<int,int>
#define fi first
#define se second
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=505,mod=998244353;
int n,m,l[N],r[N],L[N],R[N],f[N][N*N],g[N][N*N],d[N],D[N],a[N];
inline void mul(int *a,int *b,int &n,int m)
{
	static int c[N];
	for(int i=0;i<=n;i++) for(int j=0;j<=m;j++)
	{
		c[i+j]=(c[i+j]+1ll*a[i]*b[j])%mod;
	}
	for(int i=0;i<=n+m;i++) a[i]=c[i],c[i]=0;n+=m;
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>l[i]>>r[i];
	for(int i=1;i<=m;i++) cin>>L[i]>>R[i];
	f[0][0]=1;int deg=0;
	for(int i=1;i<=n;i++)
	{
		fill(a+l[i],a+r[i]+1,1);
		memcpy(f[i],f[i-1],sizeof(f[i]));
		mul(f[i],a,deg,r[i]);
		fill(a+l[i],a+r[i]+1,0);d[i]=deg;
	}

	g[0][0]=1;deg=0;
	for(int i=1;i<=m;i++)
	{
		fill(a+L[i],a+R[i]+1,1);
		memcpy(g[i],g[i-1],sizeof(g[i]));
		mul(g[i],a,deg,R[i]);
		fill(a+L[i],a+R[i]+1,0);D[i]=deg;
	}
	for(int i=1;i<=n;i++,cout<<"\n") for(int j=1;j<=m;j++)
	{
		int ans=0;
		for(int k=0;k<=min(d[i],D[j]);k++)
		{
			ans=(ans+1ll*f[i][k]*g[j][k])%mod;
		}
		cout<<ans<<" ";
	}
	
	return 0;
}