#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=505,O=500,mod=998244353;
int n,m,ra[N],la[N],rb[N],lb[N],dp[N][N][2*N];
signed main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>la[i]>>ra[i];
    for(int i=1;i<=m;i++)cin>>lb[i]>>rb[i];
    for(int i=O;i<=2*O;i++)   dp[0][0][i]=1;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            if(!i and !j)continue;
            for(int k=0;k<=2*O;k++){
                int z=0;
                if(k>O){
                    if(i)(z+=(dp[i-1][j][k-la[i]]-((k-ra[i]-1)?dp[i-1][j][k-ra[i]-1]:0)+mod)%mod)%=mod;
                    else z=0;
                }else{
                    if(j)(z+=(dp[i][j-1][k+rb[j]]-((k+lb[j]-1)?dp[i][j-1][k+lb[j]-1]:0)+mod)%mod)%=mod;
                    else z=0;
                }
                dp[i][j][k]=z;
                if(i and j and (k==O)){cout<<z<<' ';if(j==m)puts("");}
                if(k)(dp[i][j][k]+=dp[i][j][k-1])%=mod;
            }
        }
    }
    return 0;
}