#include<bits/stdc++.h>
#define eb emplace_back
#define ep emplace
using namespace std;

using ll = long long;
constexpr int N = 505, mod = 998244353;

int n, m, f[N][N][N << 1];
struct {int l, r;} a[N], b[N];


int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1; i <= n; ++ i) cin >> a[i].l >> a[i].r;
	for(int i = 1; i <= m; ++ i) cin >> b[i].l >> b[i].r;
	f[0][0][500] = 1;
	for(int i = 0; i <= n; ++ i) {
		for(int j = 0; j <= m; ++ j) {
			for(int k = 0; k <= 1000; ++ k) {
				if(i) {
					int l = max(k - a[i].r, 0), r = min(k - a[i].l, 500);
					if(l <= r) {
						f[i][j][k] = (f[i - 1][j][r] - (l ? f[i - 1][j][l - 1] : 0)) % mod;
					}
				}
				if(j) {
					int l = max(501, k + b[j].l), r = min(k + b[j].r, 1000);
					if(l <= r) {
						f[i][j][k] = (f[i][j][k] + f[i][j - 1][r] - (l ? f[i][j - 1][l - 1] : 0)) % mod; 
					}
				}
				if(k) f[i][j][k] = (f[i][j][k] + f[i][j][k - 1]) % mod;
			} 
		}
	}
	for(int i = 1; i <= n; ++ i) {
		for(int j = 1; j <= m; ++ j)
			cout << (f[i][j][500] - f[i][j][499] + mod) % mod << " \n"[j == m];
	}
	return 0;
}