#include <bits/stdc++.h>
using namespace std;
using db = double;
using lb = long double;
using ull = unsigned long long;
using uint = unsigned int;
using ll = long long;
//using i128 = __int128;
//using ui128 = unsigned __int128;
#define REP(i, first, last) for(int i = (first); i <= (last); ++ i)
#define DOW(i, first, last) for(int i = (first); i >= (last); -- i)
#define int long long
#define pb emplace_back
#define ob pop_back
#define pii pair<int, int>
#define MmodR make_pair
#define fi first
#define se second
#define tpl tuple<int, int, int>
#define MTmod make_tuple
#define poly vector<int>
#define polyp vector<pii>
#define polyt vector<tpl>
#define all(x) x.begin(), x.end()
#define CVR(a, q) memset(a, q, sizeof a)
#define CLR(a) memset(a, 0, sizeof a)
#define CmodY(a, q) memcpy(a, q, sizeof a)
#define modCT __builtin_popcount
const int N = 500 + 5, M = 1e6 + 5;
const int mod1 = 1e9 + 7, mod2 = 998244353, mod = mod2;
const long long inf = 1e18;
const int dx[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy[] = {-1, 0, 1, -1, 0, 1, -1, 0, 1};
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n, m, f[N][N][N << 1], s[N << 1];
int a[N][2], b[N][2];

void Add(int& x, int y) {
	return (x += y) >= mod ? x -= mod : x, void();
}

void Solve() {
	cin >> n >> m;
	REP(i, 1, n) cin >> a[i][0] >> a[i][1];
	REP(i, 1, m) cin >> b[i][0] >> b[i][1];
	f[0][0][N] = 1;
	REP(i, 0, n) REP(j, 0, m) {
		if (i > 0) { 
			REP(k, -500, 500) s[k + N] = f[i - 1][j][k + N], Add(s[k + N], s[k + N - 1]);
			REP(k, 0, 500) Add(f[i][j][k + N], s[k + N - a[i][0]]), Add(f[i][j][k + N], mod - s[k + N - a[i][1] - 1]);
		}
		if (j > 0) {
			DOW(k, 500, -500) s[k + N] = f[i][j - 1][k + N], Add(s[k + N], s[k + N + 1]);
			REP(k, -500, -1) Add(f[i][j][k + N], s[k + N + b[j][0]]), Add(f[i][j][k + N], mod - s[k + N + b[j][1] + 1]);
		}
	}
	REP(i, 1, n) REP(j, 1, m)
		cout << f[i][j][N] << " \n"[j == m];
}
signed main() {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int T = 1;
//	cin >> T;
	while (T --) {
		Solve();
	}
	return 0;
}