#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
const int mod=998244353;
int n,m,l[2][510],r[2][510];
ll f[510][510][1010];
signed main()
{
#ifndef ONLINE_JUDGE
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
    cin.tie(0),cout.tie(0);
    ios::sync_with_stdio(0);
    cin>>n>>m,f[0][0][500]=1,f[0][0][501]=-1;
    for(int i=1;i<=n;++i)
        cin>>l[0][i]>>r[0][i];
    for(int i=1;i<=m;++i)
        cin>>l[1][i]>>r[1][i];
    for(int i=0;i<=n;++i)
    {
        for(int j=0;j<=m;++j)
        {
            for(int k=0;k<=1000;++k)
            {
                if(k) f[i][j][k]+=f[i][j][k-1];f[i][j][k]%=mod;
                if(k>=500)
                {
                    if(j==m||!f[i][j][k]) continue;
                    f[i][j+1][k-r[1][j+1]]+=f[i][j][k];
                    f[i][j+1][k-l[1][j+1]+1]-=f[i][j][k];
                }
                else
                {
                    if(i==n||!f[i][j][k]) continue;
                    f[i+1][j][k+l[0][i+1]]+=f[i][j][k];
                    f[i+1][j][k+r[0][i+1]+1]-=f[i][j][k];
                }
            }
            if(i&&j) cout<<(f[i][j][500]+mod)%mod<<' ';
        }
        if(i) cout<<'\n';
    }
    return 0;
}