#include <bits/stdc++.h>
using namespace std;
int T, n, m, l[300010], r[300010], a[300010], b[300010];
int ksm(int x, int y) {
  int re = 1;
  for (; (y & 1 ? re = 1ll * re * x % 998244353 : 0), y;
       y >>= 1, x = 1ll * x * x % 998244353)
    ;
  return re;
}
int fac[300010], inv_fac[300010];
void work() {
  fac[0] = inv_fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % 998244353;
  inv_fac[n] = ksm(fac[n], 998244353 - 2);
  for (int i = n - 1; i >= 1; i--)
    inv_fac[i] = 1ll * inv_fac[i + 1] * (i + 1) % 998244353;
}
int C(int x, int y) {
  return 1ll * fac[x] * inv_fac[y] % 998244353 * inv_fac[x - y] % 998244353;
}
int s[300010], sum[300010][41], ans;
void add(int &x, int y) {
  x = (x + y >= 998244353 ? x + y - 998244353 : x + y);
}
void dec(int &x, int y) { x = (x - y < 0 ? x - y + 998244353 : x - y); }
bool v[300010];
int main() {
  scanf("%d %d", &n, &m);
  work();
  for (int i = 1; i <= n; i++)
    scanf("%d %d", &l[i], &r[i]), s[l[i]]++, s[r[i] + 1]--;
  for (int i = 1; i <= n; i++) s[i] += s[i - 1];
  for (int k = 0; k <= 40; k++) {
    for (int i = 1; i <= n; i++) {
      sum[i][k] = sum[i - 1][k];
      if (i >= k && s[i] >= i) add(sum[i][k], C(s[i] - k, i - k));
    }
  }
  ans = sum[n][0];
  for (int i = 1; i <= m; i++) scanf("%d %d", &a[i], &b[i]);
  for (int i = 1; i < (1 << m); i++) {
    int L = 0, R = 1e9, p = 1, tot = 0;
    for (int j = 0; j < m; j++)
      if (i >> j & 1) {
        L = max(L, max(l[a[j + 1]], l[b[j + 1]]));
        R = min(R, min(r[a[j + 1]], r[b[j + 1]]));
        if (!v[a[j + 1]]) v[a[j + 1]] = true, tot++;
        if (!v[b[j + 1]]) v[b[j + 1]] = true, tot++;
        p *= -1;
      }
    L = max(L, tot);
    if (L <= R) {
      if (p == 1)
        add(ans, (sum[R][tot] - sum[L - 1][tot] + 998244353) % 998244353);
      else
        dec(ans, (sum[R][tot] - sum[L - 1][tot] + 998244353) % 998244353);
    }
    for (int j = 0; j < m; j++)
      if (i >> j & 1) {
        v[a[j + 1]] = false;
        v[b[j + 1]] = false;
      }
  }
  printf("%d", ans);
}
