#include <bits/stdc++.h>
using ll = long long;
const int mod = 998244353;

int main() {
  std::cin.tie(0)->sync_with_stdio(0);
  const int MAXV = 500;
  int n, m;
  std::cin >> n >> m;
  std::vector<std::pair<int, int>> vx(n), vy(m);
  for (auto &[l, r] : vx) std::cin >> l >> r;
  for (auto &[l, r] : vy) std::cin >> l >> r;
  std::vector<std::array<int, 2 * MAXV + 1>> dp(m + 1);
  dp[0][MAXV] = 1;
  dp[0][MAXV + 1] = -1;
  for (int i = 0; i <= n; i++) {
    std::vector<std::array<int, 2 * MAXV + 1>> nxt(m + 1);
    for (int j = 0; j <= m; j++) {
      for (int v = 1; v <= MAXV * 2; v++) (dp[j][v] += dp[j][v - 1]) %= mod;
      if (i < n) {
        auto [li, ri] = vx[i];
        for (int v = -MAXV; v <= 0; v++) {
          (nxt[j][v + li + MAXV] += dp[j][v + MAXV]) %= mod;
          (nxt[j][v + ri + MAXV + 1] -= dp[j][v + MAXV]) %= mod;
        }
      }
      if (j < m) {
        auto [lj, rj] = vy[j];
        for (int v = 1; v <= MAXV; v++) {
          (dp[j + 1][v - rj + MAXV] += dp[j][v + MAXV]) %= mod;
          (dp[j + 1][v - lj + MAXV + 1] -= dp[j][v + MAXV]) %= mod;
        }
      }
    }
    if (i) {
      for (int j = 1; j <= m; j++) std::cout << (dp[j][MAXV] + mod) % mod << ' ';
      std::cout << '\n';
    }
    dp = nxt;
  }
}