#include <bits/stdc++.h>
#pragma GCC target "avx512dq,avx512bw,avx512vl,avx512vbmi,avx512vbmi2,bmi,abm,bmi2"
#include "immintrin.h"
#pragma GCC optimize "O3"

using namespace std;

constexpr int N = 500, S = (N + 1) * 512, mod = 998244353, B0 = 16, B1 = 16, B08 = B0 * 8;

vector<int> cx[N];

int cy[B0 * 8][S];

void wconv(const int* a, int sz, int* b, int l, int r) {
  uint32_t s = 0;
  for (int i = 0; i < l; ++i) b[i] = 0;
  for (int i = l; i < min(r, sz + l); ++i) b[i] = (s += a[i - l]) %= mod;
  for (int i = min(r, sz + l); i < sz + l; ++i) s += a[i - l] + mod - a[i - r], b[i] = s -= (s >= 2 * mod? 2 * mod: s >= mod? mod: 0);
  for (int i = sz + l; i < r; ++i) b[i] = s;
  for (int i = max(r, sz + l); i < sz + r; ++i) b[i] = (s += mod - a[i - r]) %= mod;
}

alignas(64) uint64_t ty[B1 * B08];
alignas(64) uint64_t ans[512][512];

array<int, 2> lrx[N], lry[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m; cin >> n >> m;
  for (int i = 0; i < n; ++i) cin >> lrx[i][0] >> lrx[i][1], ++lrx[i][1];
  for (int i = 0; i < m; ++i) cin >> lry[i][0] >> lry[i][1], ++lry[i][1];
  for (int i = 0; i < n; ++i) {
    cx[i].resize(N * (i + 1) + B1);
    wconv(i? &cx[i - 1][0]: &(const int&)1, N * i + 1, &cx[i][0], lrx[i][0], lrx[i][1]);
  }
  using v8u64 = __attribute((vector_size(64))) uint64_t;
  for (int I = 0; I < m; I += B08) {
    for (int i = I; i < min(I + B08, m); ++i) wconv(i? &cy[(i + B08 - 1) % B08][0]: &(const int&)1, N * i + 1, &cy[i % B08][0], lry[i][0], lry[i][1]);
    for (int K = 0; K <= (I + B08) * N; K += B1) {
      for (int i = 0; i < B08; ++i)
      for (int k = 0; k < B1; ++k) ty[i + B08 * k] = cy[i][K + k];
      for (int j = max(0, (K + N - 1) / N - 1); j < n; ++j) {
        v8u64 x[B1]{};
        for (int k = 0; k < B1; ++k) x[k] += cx[j][K + k];
        for (int i = 0; i < B0; ++i)
        for (int k = 0; k < B1; ++k) (v8u64&)ans[j][I + i * 8] += (v8u64)_mm512_mul_epu32((__m512i&)x[k], (__m512i&)ty[i + k * B0 << 3]);
        for (int i = 0; i < B0; i += 8) (v8u64&)ans[j][I + i] -= ((v8u64&)ans[j][I + i] >> 30) * mod;
      }
    }
  }
  for (int j = 0; j < n; ++j, cout << '\n')
  for (int i = 0; i < m; ++i) cout << ans[j][i] % mod << ' ';
}