#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 = 0; i < n; ++ i) cin >> a[i].l >> a[i].r;
	for(int i = 0; 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) {
			if(i < n) {
				for(int k = 0; k <= 500; ++ k) {
					if(!f[i][j][k]) continue;
					for(int x = a[i].l; x <= a[i].r; ++ x) {
						f[i + 1][j][k + x] = (f[i + 1][j][k + x] + f[i][j][k]) % mod;
					}
				}
			}
			if(j < m) {
				for(int k = 501; k <= 1000; ++ k) {
					if(!f[i][j][k]) continue;
					for(int x = b[j].l; x <= b[j].r; ++ x) {
						f[i][j + 1][k - x] = (f[i][j + 1][k - x] + f[i][j][k]) % mod;
					}
				}
			} 
		}
	}
	for(int i = 1; i <= n; ++ i) {
		for(int j = 1; j <= m; ++ j) cout << f[i][j][500] << " \n"[j == m];
	}
	return 0;
}