#include <bits/stdc++.h>
using namespace std;
const int maxN = 3e5 + 10, mod = 998244353;
int n, m, cnt;
int c[45][maxN + 1];
int fac[maxN + 1], inv[maxN + 1];
int vis[maxN + 1], T;
pair<int, int> v[maxN + 1], q[maxN + 1];
inline int read() {
  int num = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) num = (num << 3) + (num << 1) + (ch ^ 48), ch = getchar();
  return num * f;
}
inline int ADD(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
inline int SUB(int x, int y) { return x - y < 0 ? x - y + mod : x - y; }
inline int mpow(int a, int x) {
  int ans = 1;
  while (x) {
    if (x & 1) ans = 1ll * ans * a % mod;
    a = 1ll * a * a % mod;
    x >>= 1;
  }
  return ans;
}
inline int C(int n, int m) {
  if (n < 0 || m < 0 || n < m) return 0;
  return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
inline void pre() {
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  inv[n] = mpow(fac[n], mod - 2);
  for (int i = n - 1; i >= 0; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
  static int t1[maxN + 1], t2[maxN + 1];
  for (int i = 0; i <= n; i++) t1[i] = t2[i] = 0;
  for (int i = 1; i <= n; i++) t1[v[i].first]++, t2[v[i].second]++;
  T++;
  for (int i = 1; i <= m; i++) vis[q[i].first] = vis[q[i].second] = T;
  cnt = 0;
  for (int i = 1; i <= n; i++) cnt += (vis[i] == T);
  int now = 0;
  for (int i = 1; i <= n; i++) {
    now += t1[i];
    for (int j = 0; j <= cnt; j++)
      c[j][i] = ADD(c[j][i - 1], C(now - j, i - j));
    now -= t2[i];
  }
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= n; i++) v[i].first = read(), v[i].second = read();
  for (int i = 1; i <= m; i++) q[i].first = read(), q[i].second = read();
  pre();
  int ans = 0;
  for (int s = 0; s < (1 << m); s++) {
    int fl = 0;
    T++;
    vector<int> vec;
    for (int i = 1; i <= m; i++)
      if (s >> i - 1 & 1) {
        fl ^= 1;
        if (vis[q[i].first] != T) vec.push_back(q[i].first);
        if (vis[q[i].second] != T) vec.push_back(q[i].second);
        vis[q[i].first] = vis[q[i].second] = T;
      }
    int ct = vec.size(), L = 0, R = n;
    for (int i = 0; i < vec.size(); i++)
      L = max(L, v[vec[i]].first), R = min(R, v[vec[i]].second);
    if (L <= R) {
      int tp = SUB(c[ct][R], L ? c[ct][L - 1] : 0);
      ans = fl ? SUB(ans, tp) : ADD(ans, tp);
    }
  }
  printf("%d\n", ans);
  return 0;
}
