#include <bits/stdc++.h>
using namespace std;
const int N = 505,mod = 998244353; 
int n,m,mx,lx[N],rx[N],ly[N],ry[N],f[2][N][2*N],s[2][N][2*N];
int main(){
	cin.tie(0),cout.tie(0);
	ios::sync_with_stdio(0);
	cin >> n >> m;
	for(int i=1;i<=n;i++) cin >> lx[i] >> rx[i],mx = max(mx,rx[i]);
	for(int i=1;i<=m;i++) cin >> ly[i] >> ry[i],mx = max(mx,ry[i]);
    mx = 500;
	f[0][0][mx] = s[0][0][mx] = 1;
	for(int i=mx;i<=2*mx;i++) s[0][0][i] = 1;
	for(int i=0;i<=n;i++){
		int o = i&1;
		for(int j=0;j<=m;j++){
			if(i+j==0) continue;
			for(int k=0,l,r;k<=2*mx;k++){
				f[o][j][k] = 0;
                if(i){
					l = max(k-rx[i]-1,0),r = min(mx-1,k-lx[i]);
					if(l<=r) f[o][j][k] += (s[o^1][j][r]-s[o^1][j][l])%mod;
				}
				if(j){
					l = max(mx-1,k+ly[j]-1),r = min(k+ry[j],2*mx);
					if(l<=r) f[o][j][k] += (s[o][j-1][r]-s[o][j-1][l])%mod;
				}
				f[o][j][k] = s[o][j][k] = (f[o][j][k]+2*mod)%mod;
			}
			for(int k=1;k<=2*mx;k++) s[o][j][k] += s[o][j][k-1],s[o][j][k] %= mod;
			if(i && j) cout << f[o][j][mx] << " ";
		}
		cout << "\n";
	}
	return 0;
}