#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=509,Mod=998244353;
ll n,m,L[N],R[N],U[N],V[N],dp[2][N][N*2],dt[N*2],cur,ans[N][N];
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    n=read(),m=read();
    rep(i,1,n)L[i]=read(),R[i]=read();
    rep(i,1,m)U[i]=read(),V[i]=read();
    dp[0][0][0+500]=1;
    //k 表示 A-B
    //k<=0 时转移 A，否则转移 B
    rep(i,0,n){
        memset(dp[cur^1],0,sizeof(dp[cur^1]));
        rep(j,0,m){
            rep(k,1,1000)dt[k]=(dt[k-1]+dt[k])%Mod;
            rep(k,-500,500)dp[cur][j][k+500]=(dp[cur][j][k+500]+dt[k+500])%Mod;
            memset(dt,0,sizeof(dt));
            if(i&&j)ans[i][j]=dp[cur][j][0+500];
            if(j==m)break;
            rep(k,1,500){
                if(!dp[cur][j][k+500])continue;
                // cout<<i<<" "<<j<<" "<<k<<" "<<dp[cur][j][k+500]<<endl;
                ll l=k-V[j+1],r=k-U[j+1];
                l=max(l,-500ll);
                if(l>r)continue;
                dt[l+500]=(dt[l+500]+dp[cur][j][k+500])%Mod;
                dt[r+500+1]=(dt[r+500+1]-dp[cur][j][k+500]+Mod)%Mod;
            }
        }
        if(i<n){
            rep(j,0,m){
                memset(dt,0,sizeof(dt));
                rep(k,-500,0){
                    if(!dp[cur][j][k+500])continue;
                    ll l=k+L[i+1],r=k+R[i+1];
                    r=min(r,500ll);
                    if(l>r)continue;
                    dt[l+500]=(dt[l+500]+dp[cur][j][k+500])%Mod;
                    dt[r+500+1]=(dt[r+500+1]-dp[cur][j][k+500]+Mod)%Mod;
                }
                rep(k,1,1000)dt[k]=(dt[k-1]+dt[k])%Mod;
                rep(k,-500,500)dp[cur^1][j][k+500]=(dp[cur^1][j][k+500]+dt[k+500])%Mod;
            }
            cur^=1;
        }
    }
    rep(i,1,n){
        rep(j,1,m)write(ans[i][j]),putchar(' ');
        putchar('\n');
    }
    cerr<<"\n"<<clock()*1.0/CLOCKS_PER_SEC*1000<<"ms\n";
    return 0;
}