#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
const int mod = 998244353;
int k, e, n;
int dp[505][505][1005];
int lx[505], ly[505], rx[505], ry[505];
void solve() {
    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];
    }

    for (int i = 0;i <= n;i++) {
        for (int j = 0;j <= m;j++) {
            for (int k = 1;k <= 1000;k++) {
                dp[i][j][k] += dp[i][j][k - 1] %mod;
            }
            dp[0][0][500] = 1;
            for (int k = 0;k <= 1000;k++) {
                if (k <= 500) {
                    dp[i + 1][j][k + lx[i + 1]] += dp[i][j][k] % mod;
                    dp[i + 1][j][k + rx[i + 1] + 1] -= (dp[i][j][k] - mod) % mod;
                    dp[i + 1][j][k + lx[i + 1]] %= mod;
                    dp[i + 1][j][k + lx[i + 1] + 1] %= mod;
                }
                else {
                    dp[i][j + 1][k - ry[j + 1]] += dp[i][j][k] % mod;
                    dp[i][j + 1][k - ly[j + 1] + 1] -= (dp[i][j][k] - mod) % mod;
                    dp[i][j + 1][k - ry[j + 1]] %= mod;
                    dp[i][j + 1][k - ry[j + 1] + 1] %= mod;
                }
            }
        }
    }
    for (int i = 1;i <= n;i++) {
        for (int j = 1;j <= m;j++) {
            cout << dp[i][j][500] % mod << " ";
        }
        cout << endl;
    }
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}