#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct Segment{
    int l, r;
    Segment(int l = 0, int r = 0): l(l), r(r) {}
};

const int MAXN = 50+5;
const int M = 51;
const ll mod = 998244353;
int n, m;
ll sum[MAXN*2], dp[MAXN][MAXN][MAXN*2];
Segment sx[MAXN], sy[MAXN];

ll qry(int l, int r){
    if(l > r) return 0;
    // cout << "qry " << l << " " << r << "\n";
    return (sum[r+M] - sum[l+M-1] + mod) % mod;
}

int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        int l, r;
        cin >> l >> r;
        sx[i] = Segment(l, r);
    }
    for(int i = 1; i <= m; i++){
        int l, r;
        cin >> l >> r;
        sy[i] = Segment(l, r);
    }
    dp[0][0][M] = 1;
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= m; j++){
            // cout << "i = " << i << " j = " << j << "\n";
            if(i == n && j == m) break;
            for(int k = -50; k <= 50; k++){
                sum[k+M] = (sum[k+M-1] + dp[i][j][k+M]) % mod;
                // cout << "dp " << i << " " << j << " " << k << " = " << dp[i][j][k+M] << "\n";
            }
            // cout << "\n";
            for(int k = -50; k <= 50; k++){
                // cout << "k = " << k << "\n";
                // cout << "qry " << max(-50, k-sx[i+1].r) << " " << min(0, k-sx[i+1].l) << " " << qry(max(-50, k-sx[i+1].r), min(0, k-sx[i+1].l)) << "\n";
                dp[i+1][j][k+M] = (dp[i+1][j][k+M] + qry(max(-50, k-sx[i+1].r), min(0, k-sx[i+1].l))) % mod;
                dp[i][j+1][k+M] = (dp[i][j+1][k+M] + qry(max(1, k+sy[j+1].l), min(50, k+sy[j+1].r))) % mod;
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cout << dp[i][j][0+M] << ' ';
        }
        cout << "\n";
    }
    return 0;
}