#include <iostream>
using namespace std;
#define int long long
const int O = 502,mod = 998244353;
int n,m,dp[505][505][1010],lx[505],rx[505],ly[505],ry[505];
int sum(int x,int y,int l,int r) {
	return (dp[x][y][r]-(l?dp[x][y][l-1]:0)+mod)%mod;
}
signed main() {
	cin.tie(0)->sync_with_stdio(false);
	int n,m; cin >> n >> m;
	for(int i = 1; i <= n; i++) cin >> lx[i] >> rx[i];
	for(int i = 1; i <= m; i++) cin >> ly[i] >> ry[i];
	for(int i = 0; i <= O+O; i++) dp[0][0][i] = (i >= O);
	for(int i = 0; i <= n; i++) {
		for(int j = 0; j <= m; j++) {
			if(i == j && j == 0) continue;
			for(int k = 0; k <= O+O; k++) {
				if(k > O) {
					if(i) dp[i][j][k] = sum(i-1,j,k-rx[i],k-lx[i]);
					else dp[i][j][k] = 0;
				} else {
					if(j) dp[i][j][k] = sum(i,j-1,k+ly[j],k+ry[j]);
					else dp[i][j][k] = 0;
				}
				if(k) (dp[i][j][k] += dp[i][j][k-1]) %= mod;
			}
		}
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			cout << (dp[i][j][O]-dp[i][j][O-1]+mod)%mod << ' ';
		} cout << endl;
	}
	return 0;
}