#include<bits/stdc++.h>
#pragma GCC optimize("-ofast")
using namespace std;
#define endl '\n'
mt19937 rnd(537462565);
const int mod=998244353,V=505;
int n,m,la[555],ra[555],lb[555],rb[555];
struct Hash {
    std::size_t operator()(const int& k) const {
        return k+V;
    }
};
struct KeyEqual {
    bool operator()(const int& lhs, const int& rhs) const {
        return lhs == rhs;
    }
};
unordered_map<int,int,Hash,KeyEqual> dp[555][555];
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	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=0;i<=V;i++)dp[0][0][i]=1;
	for(int i=0;i<=n;cout<<(i?"\n":""),i++)for(int j=0;j<=m;j++)if(i||j){
		if(i)for(int p=0;p<=V;p++)(dp[i][j][p]+=(dp[i-1][j][p-la[i]]+mod-dp[i-1][j][p-ra[i]-1])%mod)%=mod;
		if(j)for(int p=-V;p<0;p++)(dp[i][j][p]+=(dp[i][j-1][p+rb[j]]+mod-dp[i][j-1][p+lb[j]-1])%mod)%=mod;
		if(i)dp[i-1][j].clear();
		if(i&&j)cout<<dp[i][j][0]<<' ';
		for(int p=-V;p<=V;p++)(dp[i][j][p]+=dp[i][j][p-1])%=mod;
	}
	return 0;
}