#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define N 501
#define i128 __int128
#define db long double
#define pii pair<int,int>
#define st first
#define ed second
#define mkp make_pair
#define pb push_back
#define eps 1e-9
#define mod 998244353
#define mod2 1000000007
#define bs 13131
#define bs2 131
#define INF 0x3f3f3f3f3f3f3f3f
#define il inline
#define vi vector<int>
#define ins insert
#define umap unordered_map
#define uset unordered_set
#define R(x) x.begin(),x.end()
#define B(x) x.begin()
#define E(x) x.end()
#define lb lower_bound
#define ub upper_bound
#define prq priority_queue
il int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return x*f;
}
int T=1,n,m,q,k;
int s[N];
int l[2][N],r[2][N];
int f[N][N][N<<1];
signed main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++)l[0][i]=read(),r[0][i]=read();
	for(int i=1;i<=m;i++)l[1][i]=read(),r[1][i]=read();
	int M=500;
	f[0][0][M]=1,f[0][0][M+1]=-1;
	for(int i=0;i<=n;i++)for(int j=0;j<=m;j++){
		for(int k=1;k<=M<<1;k++)f[i][j][k]=(f[i][j][k]+f[i][j][k-1])%mod;
		for(int k=0;k<M;k++)f[i+1][j][k+l[0][i+1]]=(f[i+1][j][k+l[0][i+1]]+f[i][j][k])%mod,f[i+1][j][k+r[0][i+1]+1]=(f[i+1][j][k+r[0][i+1]+1]-f[i][j][k])%mod;
		for(int k=M;k<=M<<1;k++)f[i][j+1][k-r[1][j+1]]=(f[i][j+1][k-r[1][j+1]]+f[i][j][k])%mod,f[i][j+1][k-l[1][j+1]+1]=(f[i][j+1][k-l[1][j+1]+1]-f[i][j][k])%mod;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++)
			printf("%lld ",(f[i][j][M]+mod)%mod);
		puts("");
	}
	return 0;
}