#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define lowbit(x) ((x)&(-x))
#define endl '\n'

typedef long long LL;
typedef pair<LL,LL> PII;
const int N=510,M=2e5+10,mod=998244353,INF=0x3f3f3f3f;
LL n,m,k;
int al[N],ar[N],bl[N],br[N];
int dp[N][N][2*N];

void solve() {
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>al[i]>>ar[i];
    }
    for(int j=1;j<=m;j++){
        cin>>bl[j]>>br[j];
    }
    dp[0][0][500]=1;
    dp[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++){
                dp[i][j][k]+=dp[i][j][k-1];
                dp[i][j][k]%=mod;
            }
            for(int k=0;k<=1000;k++){
                if(k<=500){
                    dp[i+1][j][k+al[i+1]]+=dp[i][j][k];
                    dp[i+1][j][k+ar[i+1]+1]-=dp[i][j][k];
                    dp[i+1][j][k+al[i+1]]%=mod;
                    dp[i+1][j][k+ar[i+1]]%=mod;
                }else{
                    dp[i][j+1][k-br[j+1]]+=dp[i][j][k];
                    dp[i][j+1][k-bl[j+1]+1]-=dp[i][j][k];
                    dp[i+1][j][k-br[j+1]]%=mod;
                    dp[i+1][j][k-bl[j+1]+1]%=mod;
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout<<dp[i][j][500]<<" \n"[j==m];
        }
    }
}

int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int _;
    _=1;
    //cin>>_;
    while(_--) {
        solve();
    }
    return 0;
}