#include <bits/stdc++.h>

using namespace std;

typedef long long int	ll;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;


#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp              make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl;
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("tests.in" , "r" , stdin) ;

ll mod = 998244353 ;

const int N = 507, M=502;

int dp[N][N][2*N];
int a[N], b[N];
int l1[N], r1[N], l2[N], r2[N];
int n, m;

int main()
{

    fast_io
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>l1[i]>>r1[i];
    for (int i=1; i<=m; i++) cin>>l2[i]>>r2[i];

    dp[0][0][M]=1;

    for(int i=0; i<=n; i++) {
		for(int j=0; j<=m; j++) {
			if(i || j) for(int k=1; k<2*M; k++) dp[i][j][k]=(dp[i][j][k]+dp[i][j][k-1])%mod;
            if(i && j) cout<<dp[i][j][M]<<" ";
			for (int k=0; k<M; k++){
                dp[i+1][j][k+l1[i+1]]=(dp[i+1][j][k+l1[i+1]]+dp[i][j][k])%mod;
                dp[i+1][j][k+r1[i+1]+1]=(dp[i+1][j][k+r1[i+1]+1]-dp[i][j][k]+mod)%mod;
                dp[i][j+1][M-r2[j+1]+k]=(dp[i][j+1][M-r2[j+1]+k]+dp[i][j][M+k])%mod;
                dp[i][j+1][M-l2[j+1]+1+k]=(dp[i][j+1][M-l2[j+1]+1+k]-dp[i][j][M+k]+mod )%mod;

			}
		}
		if(i) cout<<endl;
	}

}