#include <cstdio>
#include <vector>
#include <algorithm>

#define int long long

using namespace std;

const int N = 505;
const int mod = 998244353;

int n, m, l[2][N], r[2][N], ans[N][N];

vector <int> f[N][N];

signed main()
{
    scanf("%lld%lld", &n, &m);
    for(int i = 1; i <= n; ++ i)
        scanf("%lld%lld", &l[0][i], &r[0][i]);
    for(int i = 1; i <= m; ++ i)
        scanf("%lld%lld", &l[1][i], &r[1][i]);

    f[0][0].resize(N << 1);
    f[0][0][0 + N] = 1;
    f[0][0][0 + 1 + N] = -1;
    for(int i = 0; i <= n; ++ i)
    {
        for(int j = 0; j <= m; ++ j)
        {
            f[i][j + 1].resize(N << 1);
            f[i + 1][j].resize(N << 1);
            for(int k = -500; k <= 500; ++ k)
                f[i][j][k + N] = (f[i][j][k + N] + f[i][j][k - 1 + N]) % mod;
            for(int k = -500; k <= 500; ++ k)
            {
                if(k < 0)
                {
                    (f[i][j + 1][k + l[1][j + 1] + N] += f[i][j][k + N]) %= mod;
                    (f[i][j + 1][k + r[1][j + 1] + 1 + N] -= f[i][j][k + N]) %= mod;
                }
                else
                {
                    (f[i + 1][j][k - r[0][i + 1] + N] += f[i][j][k + N]) %= mod;
                    (f[i + 1][j][k - l[0][i + 1] + 1 + N] -= f[i][j][k + N]) %= mod; 
                }
            }
            ans[i][j] = f[i][j][0 + N];
            f[i][j].clear();
            f[i][j].shrink_to_fit();
        }
    }
    
    for(int i = 1; i <= n; ++ i)
    {
        for(int j = 1; j <= m; ++ j)
            printf("%lld ", ans[i][j]);
        printf("\n");
    }

    return 0;
}