#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<array>
#include<unordered_map>
#include<vector>
#include<bitset>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<numeric>
using namespace std;
#define int long long
#define ll long long
#define ull unsigned long long
#define lc (x<<1)
#define rc (x<<1|1)
#define pii pair<int,int>
#define mkp make_pair
#define fi first
#define se second
const int Mx=305,B=300,p=998244353;
int read(){
	char ch=getchar();
	int Alice=0,Aya=1;
	while(ch<'0'||ch>'9'){
		if(ch=='-') Aya=-Aya;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
		Alice=(Alice<<3)+(Alice<<1)+(ch^48),ch=getchar();
	return (Aya==1?Alice:-Alice);
}
int n,m;
struct Seg{
	int l,r;
}a[Mx],b[Mx];
int f[Mx][Mx<<1],g[Mx][Mx<<1];
int pf[Mx<<1],pg[Mx][Mx<<1];
signed main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++) a[i].l=read(),a[i].r=read();
	for(int i=1;i<=m;i++) b[i].l=read(),b[i].r=read();
	pg[0][0+B]=1,pg[0][0+B+1]=p-1;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=m;j++){
			for(int s=-B+B;s<=B+B;s++){
				f[j][s]=(s==0?pg[j][s]:pg[j][s]+f[j][s-1])%p;
				pg[j][s]=0;
			}
		}
		for(int j=0;j<=m;j++){
			for(int s=-B+B;s<=B+B;s++){
				pg[j][s]=0;
			}
			for(int s=-B+B;s<=0+B;s++){
				int v=f[j][s];
				(pg[j][s+a[i+1].l]+=v)%=p;
				(pg[j][s+a[i+1].r+1]-=v)%=p;
			}
			for(int s=1+B;s<=B+B;s++){
				int v=f[j][s];
				(pf[s-b[j+1].r]+=v)%=p;
				(pf[s-b[j+1].l+1]-=v)%=p;
			}
			for(int s=-B+B;s<=B+B;s++){
				pf[s]=(s==0?pf[s]:pf[s]+pf[s-1])%p;
				(f[j+1][s]+=pf[s])%=p;
			}
			for(int s=-B+B;s<=B+B;s++) pf[s]=0;
		}
		if(i!=0){
			for(int j=1;j<=m;j++) cout<<(f[j][0+B]+p)%p<<" ";
			cout<<endl;
		}
	}
	return 0;
}
/*
Hello!!
Sample:
2 3
1 2
2 3
1 4
2 2
1 3
-------------------
*/