#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define mkp make_pair
#define pir pair <ll, ll>
#define pb emplace_back
#define i128 __int128
using namespace std;
template <class T>
void rd(T &x) {
	char ch; ll f = 0;
	while(!isdigit(ch = getchar()))
		if(ch == '-') f = 1;
	x = ch - '0';
	while(isdigit(ch = getchar()))
		x = (x << 1) + (x << 3) + ch - '0';
	if(f) x = -x;
}
const ll maxn = 510, mod = 998244353;
template <class T>
void add(T &x, const T y) { x = x + y >= mod? x + y - mod : x + y; }
ll n, m, lx[maxn], rx[maxn], ly[maxn], ry[maxn];
ll _[2][maxn][maxn << 1], *dp[2][maxn];
ll __[2][maxn][maxn << 2], *sum[2][maxn];
int main() {
	rd(n), rd(m);
	for(ll i = 1; i <= n; i++) rd(lx[i]), rd(rx[i]);
	for(ll i = 1; i <= m; i++) rd(ly[i]), rd(ry[i]);
	for(ll i = 0; i < 2; i++)
		for(ll j = 0; j <= m; j++)
			dp[i][j] = _[i][j] + 505, sum[i][j] = __[i][j] + 505;
	for(ll i = 0; i <= n; i++) {
		ll cur = i & 1; memset(_[cur], 0, sizeof _[cur]);
		memset(__[cur], 0, sizeof __[cur]);
		if(i == 0) dp[0][0][0] = 1;
		for(ll j = 0; j <= m; j++) {
			for(ll k = -500; k <= 499; k++) {
				ll l, r;
				if(i) {
					l = lx[i], r = rx[i];
					l = max(l, k + 1), r = min(r, k + 500);
					if(l <= r)
						add(dp[cur][j][k], sum[cur ^ 1][j][k - l]),
						add(dp[cur][j][k], mod - sum[cur ^ 1][j][k - r - 1]);
				}
				if(j) {
					l = ly[j], r = ry[j];
					l = max(l, -k), r = min(r, 500 - k);
					if(l <= r)
						add(dp[cur][j][k], sum[cur][j - 1][k + r]),
						add(dp[cur][j][k], mod - sum[cur][j - 1][k + l - 1]);
				}
				sum[cur][j][k] = dp[cur][j][k];
				add(sum[cur][j][k], sum[cur][j][k - 1]);
//				printf("\ndp[%lld, %lld, %lld] = %lld\n", i, j, k, dp[cur][j][k]);
			}
			if(i && j) printf("%lld ", dp[cur][j][0]);
		} if(i) puts("");
	}
	return 0;
}