#include <bits/stdc++.h>

const int mod = 998244353;
struct modint {
  int x;
  modint(int o = 0) {x = o;}
  modint &operator = (int o) {return x = o, *this;}
  modint &operator += (modint o) {return x = x+o.x >= mod ? x+o.x-mod : x+o.x, *this;}
  modint &operator -= (modint o) {return x = x-o.x < 0 ? x-o.x+mod : x-o.x, *this;}
  modint &operator *= (modint o) {return x = 1ll*x*o.x%mod, *this;}
  modint &operator ^= (int b) {
    modint a = *this, c = 1;
    for (; b; b >>= 1, a *= a) if(b & 1) c *= a;
    return x=c.x, *this;
  }
  modint &operator /= (modint o) {return *this *= o ^= mod-2;}
  friend modint operator + (modint a, modint b) {return a += b;}
  friend modint operator - (modint a, modint b) {return a -= b;}
  friend modint operator * (modint a, modint b) {return a *= b;}
  friend modint operator / (modint a, modint b) {return a /= b;}
  friend modint operator ^(modint a,int b) {return a ^= b;}
  friend bool operator == (modint a, int b) {return a.x == b;}
  friend bool operator != (modint a, int b) {return a.x != b;}
  bool operator ! () {return !x;}
  modint operator - () {return x ? mod-x : 0;}
  bool operator < (const modint &b) const {return x < b.x;}
};
inline modint qpow(modint x, int y) {return x ^ y;}

std::vector<modint> fac, ifac, iv;
inline void initC(int n) {
  if(iv.empty()) fac = ifac = iv = std::vector<modint>(2,1);
  int m = iv.size(); ++n;
  if(m >= n) return;
  iv.resize(n + 1), fac.resize(n + 1), ifac.resize(n + 1);
  for (int i = m; i <= n; i++) {
    iv[i] = iv[mod%i] * (mod - mod/i);
    fac[i] = fac[i-1] * i, ifac[i] = ifac[i-1] * iv[i];
  }
}
inline modint C(int n, int m) {
  if(m<0 || n<m) return 0;
  return initC(n), fac[n] * ifac[m] * ifac[n-m];
}

using v1 = std::vector<modint>;
using v2 = std::vector<v1>;
using v3 = std::vector<v2>;

int main() {
  int n, m; scanf("%d %d", &n, &m);
  int v = 502;
  std::vector<int> la(n + 1), ra(n + 1), lb(m + 1), rb(m + 1);
  for (int i = 1; i <= n; i++) scanf("%d %d", &la[i], &ra[i]);
  for (int i = 1; i <= m; i++) scanf("%d %d", &lb[i], &rb[i]);
  v3 f(n + 1, v2(m + 1, v1(2 * v + 1))), s(f);
  f[0][0][v] = 1;
  for (int i = v; i <= v + v; i++) s[0][0][i] = 1;
  modint ans = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= m; j++) {
      if (j) for (int k = 1; k < v; k++) f[i][j][k] = s[i][j - 1][k + rb[j]] - s[i][j - 1][k + lb[j] - 1];
      if (i) for (int k = v; k < v + v; k++) f[i][j][k] = s[i - 1][j][k - la[i]] - s[i - 1][j][k - ra[i] - 1];
      if (i && j) printf("%d ", f[i][j][v]);  
      s[i][j][0] = f[i][j][0];
      if (i || j) for (int k = 1; k <= v + v; k++) s[i][j][k] = s[i][j][k - 1] + f[i][j][k];
    } 
    if (i) printf("\n");
  }
}