#include<cstdio>
#include<cstring>
#include<algorithm>
#include<utility>
#include<ctime>
#include<vector>
#include<queue>
#include<iostream>
#include<set>
#include<random>
#include<string>
#include<cmath>
#include<chrono>
#include<map>
#define eb emplace_back

using namespace std;
const int maxn=5e2+10, maxm=1.2e4+10, inf=2e9+12, P=998244353;
typedef long long LL;
typedef unsigned long long ULL;
const LL INF=4e18;
typedef pair<int, int> pii;
typedef pair<LL, int> pli;
typedef pair<int, LL> pil;

inline int read() {
    int x=0, f=1; char c=getchar();
    for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
    for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
    return f?x:-x;
}
inline int add(int x, int y) {x+=y; return x>=P?x-P:x;}
inline int del(int x, int y) {x-=y; return x<0?x+P:x;}
inline int ksm(int x, int y) {
    int s=1; for(; y; y>>=1, x=1LL*x*x%P) if(y&1) s=1LL*s*x%P; return s;
}
mt19937 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count());
int gcd(int x, int y) {return y?gcd(y, x%y):x;}

int lx[maxn], rx[maxn], ly[maxn], ry[maxn];
int f[2][maxn][maxn<<1], ans[maxn][maxn];
int main() {
    int n=read(), m=read();
    int V=0;
    for(int i=1; i<=n; ++i) lx[i]=read(), rx[i]=read(), V=max(V, rx[i]);
    for(int i=1; i<=m; ++i) ly[i]=read(), ry[i]=read(), V=max(V, ry[i]);
    int M=maxn, cur=0;
    f[0][0][M]=1;
    for(int _=0; _<n+m; ++_, cur^=1) {
        for(int i=0; i<=n; ++i) for(int s=M-V; s<=M+V; ++s) f[cur^1][i][s]=0;
        for(int i=0; i<=_&&i<=n; ++i) //i  _-i
            for(int s=M-V; s<=M+V; ++s) {
                int val=f[cur][i][s]; if(val==0) continue;
                if(s<M&&i<n) {
                    f[cur^1][i+1][s+lx[i+1]]=add(f[cur^1][i+1][s+lx[i+1]], val);
                    f[cur^1][i+1][s+rx[i+1]+1]=del(f[cur^1][i+1][s+rx[i+1]+1], val);
                }
                if(s>=M&&_-i<m) {
                    f[cur^1][i][s-ry[_-i+1]]=add(f[cur^1][i][s-ry[_-i+1]], val);
                    f[cur^1][i][s-ly[_-i+1]+1]=del(f[cur^1][i][s-ly[_-i+1]+1], val);
                }
            }
        for(int i=0; i<=_+1&&i<=n; ++i)
            for(int s=M-V; s<=M+V; ++s) f[cur^1][i][s]=add(f[cur^1][i][s], f[cur^1][i][s-1]);
        for(int i=1; i<=_+1&&i<=n; ++i) ans[i][_+1-i]=f[cur^1][i][M];
    }
    for(int i=1; i<=n; ++i, puts(""))
        for(int j=1; j<=m; ++j) printf("%d ", ans[i][j]);
    
    return 0;
}