#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

void inc(ll &a, ll b) {
    a += b;
    if (a >= mod) a -= mod;
}
void dec(ll &a, ll b) {
    a -= b;
    if (a < 0) a += mod;
}
ll add(ll a, ll b) {
    a += b;
    return a >= mod ? a - mod : a;
}
ll del(ll a, ll b) {
    a -= b;
    return a < 0 ? a + mod : a;
}
ll qmi(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
ll inv(ll a) {
    return qmi(a, mod - 2);
}

ll f[510][510][1010];
int lx[510], rx[510], ly[510], ry[510];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    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];
    f[0][0][500] = 1, f[0][0][501] = -1;
    for (int i = 0; i <= n; ++i) 
        for (int j = 0; j <= m; ++j) {
            for (int k = 1; k <= 1000; ++k) inc(f[i][j][k], f[i][j][k - 1]);
            for (int k = 0; k <= 1000; ++k) {
                if (k <= 500) {
                    inc(f[i + 1][j][k + lx[i + 1]], f[i][j][k]);
                    dec(f[i + 1][j][k + rx[i + 1] + 1], f[i][j][k]);
                } else {
                    inc(f[i][j + 1][k - ry[j + 1]], f[i][j][k]);
                    dec(f[i][j + 1][k - ly[j + 1] + 1], f[i][j][k]);
                }
            }
        }
    for (int i = 1; i <= n; ++i) 
        for (int j = 1; j <= m; ++j) 
            cout << f[i][j][500] << " \n"[j == m];
}