#include <bits/stdc++.h>
using namespace std;
namespace Slongod{
const int N = 505 , V = 500 , mod = 998244353;
int n , m , lx[N] , rx[N] , ly[N] , ry[N] , *sum[N][N];

void main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++){cin >> lx[i] >> rx[i];}
    for (int i = 1; i <= m; i++){cin >> ly[i] >> ry[i];}
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            sum[i][j] = new int[N*2]; sum[i][j] += N;
        }
    }
    sum[0][0][0] = 1;
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            for (int k = -V; k <= V; k++) {
                if (k < 0 and j) { // 上一个走的 j
                    sum[i][j][k] = (sum[i][j-1][k+ry[j]] - sum[i][j-1][k+ly[j]-1] + mod) % mod;
                }
                if (k >= 0 and i) { // 上一个走的 i
                    sum[i][j][k] = (sum[i-1][j][k-lx[i]] - sum[i-1][j][k-rx[i]-1] + mod) % mod;
                }
            }
            for (int k = -V; k <= V; k++) {
                sum[i][j][k] = (sum[i][j][k-1] + sum[i][j][k]) % mod;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cout << (sum[i][j][0] - sum[i][j][-1] + mod) % mod << ' ';
        } cout << '\n';
    }
}
}int main()
{
    ios :: sync_with_stdio(0);
    cin.tie(0) , cout.tie(0);
    return Slongod :: main(),0;
}