#include <bits/stdc++.h>

using namespace std;

const int N = 510, mod = 998244353;
int f[N][N][2 * N], lx[N], rx[N], ly[N], ry[N];

void inc(int &x, int y) {
  if ((x += y) >= mod) x -= mod;
}

void dec(int &x, int y) {
  if ((x -= y) < 0) x += mod;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m;
  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];
  const int Z = 500;
  f[0][0][Z] = 1, f[0][0][Z + 1] = mod - 1;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= m; j++) {
      for (int k = 1; k <= 2 * Z; k++) {
        inc(f[i][j][k], f[i][j][k - 1]);
      }
      if (i < n) {
        for (int k = 0; k <= Z; k++) {
          inc(f[i + 1][j][k + lx[i + 1]], f[i][j][k]);
          dec(f[i + 1][j][k + rx[i + 1] + 1], f[i][j][k]);
        }
      }
      if (j < m) {
        for (int k = Z + 1; k <= 2 * Z; k++) {
          inc(f[i][j + 1][k - ry[j + 1]], f[i][j][k]);
          dec(f[i][j + 1][k - lx[j + 1] + 1], f[i][j][k]);
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cout << f[i][j][Z] << " \n"[j == m];
    }
  }
}