#include<bits/stdc++.h>
#define F(i,j,k) for(auto i=j;i<=(decltype(i))k;i++)
#define x first
#define y second
#define exec(...) [&](){__VA_ARGS__}()
#define endl '\n'
#define os ostream
#define pb push_back
#define view(x) begin(x),end(x)
#define lambda [&]
using namespace std;
using ll=long long;
template<typename T>void ckmin(T& x,T y){x=min(x,y);}
template<typename T>void ckmax(T& x,T y){x=max(x,y);}

#ifdef DEBUG
template<typename T1,typename T2>os& operator<<(os&,pair<T1,T2>);
template<typename T,typename=decltype(T().begin()),typename=enable_if_t<!is_same_v<decay_t<T>,string>>>os& operator<<(os& out,T x){auto n=0u;out<<"{";for(auto i:x) out<<i<<(++n==x.size()?"":",");return out<<"}";}
template<typename ...T>os& operator<<(os& out,tuple<T...> x){return apply(lambda(T... x){auto n=0u;out<<"{";((out<<x<<(++n==sizeof...(T)?"":",")),...);},x),out<<"}";}
template<typename T1,typename T2>os& operator<<(os& out,pair<T1,T2> x){return out<<tuple(x);}
#define debug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<" = "<<std::make_tuple(__VA_ARGS__)<<endl
#else
#define debug(...) (void)0
#endif

const int maxn=505,mod=998244353;

int n,m;
pair<int,int> a[maxn],b[maxn];
int amb[maxn][maxn][maxn],bma[maxn][maxn][maxn];

signed main(){
#if not defined(DEBUG) and 0
#define FILENAME 
	[](...){}(freopen(FILENAME ".in","r",stdin),freopen(FILENAME ".out","w",stdout));
#endif
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m;
	F(i,1,n) cin>>a[i].x>>a[i].y;
	F(i,1,m) cin>>b[i].x>>b[i].y;
	amb[0][0][0]=1,amb[0][0][1]=-1;
	F(i,0,n) F(j,0,m){
		F(k,1,500) (amb[i][j][k]+=amb[i][j][k-1])%=mod;
		F(k,1,500) (bma[i][j][k]+=bma[i][j][k-1])%=mod;
		if(i&&j) cout<<amb[i][j][0]<<" \n"[j==m];
		F(k,0,500){
			{
				//amb[i][j+1][ k-b[j+1].y ... k-b[j+1].x ]++;
				if(k-b[j+1].x>=0){
					(amb[i][j+1][max(0,k-b[j+1].y)]+=amb[i][j][k])%=mod;
					(amb[i][j+1][k-b[j+1].x+1]+=mod-amb[i][j][k])%=mod;
				}
				//bma[i][j+1][ b[j+1].x-k ... b[j+1].y-k ]++;
				if(b[j+1].y-k>0){
					(bma[i][j+1][max(1,b[j+1].x-k)]+=amb[i][j][k])%=mod;
					(bma[i][j+1][b[j+1].y-k+1]+=mod-amb[i][j][k])%=mod;
				}
			}
			{
				//bma[i+1][j][ k-a[i+1].y ... k-a[i+1].x ]++;
				if(k-a[i+1].x>0){
					(bma[i+1][j][max(1,k-a[i+1].y)]+=bma[i][j][k])%=mod;
					(bma[i+1][j][k-a[i+1].x+1]+=mod-bma[i][j][k])%=mod;
				}
				//amb[i+1][j][ a[i+1].x-k ... a[i+1].y-k ]++;
				if(a[i+1].y-k>=0){
					(amb[i+1][j][max(0,a[i+1].x-k)]+=bma[i][j][k])%=mod;
					(amb[i+1][j][a[i+1].y-k+1]+=mod-bma[i][j][k])%=mod;
				}
			}
		}
	}
}