Problem: Polycarp plays a (yet another!) strategic computer game. In this game, he leads an army of mercenaries.

Polycarp wants to gather his army for a quest. There are n mercenaries for hire, and the army should consist of some subset of them.

The i-th mercenary can be chosen if the resulting number of chosen mercenaries is not less than l_i (otherwise he deems the quest to be doomed) and not greater than r_i (he doesn't want to share the trophies with too many other mercenaries). Furthermore, m pairs of mercenaries hate each other and cannot be chosen for the same quest. 

How many non-empty subsets does Polycarp need to consider? In other words, calculate the number of non-empty subsets of mercenaries such that the size of this subset belongs to [l_i, r_i] for each chosen mercenary, and there are no two mercenaries in the subset that hate each other.

The answer may be large, so calculate it modulo 998244353.

Input

The first line contains two integers n and m (1 ≤ n ≤ 3 ⋅ 10^5, 0 ≤ m ≤ min(20, (n(n-1))/(2))) — the number of mercenaries and the number of pairs of mercenaries that hate each other.

Then n lines follow, the i-th of them contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n).

Then m lines follow, the i-th of them contains two integers a_i and b_i (1 ≤ a_i < b_i ≤ n) denoting that the mercenaries a_i and b_i hate each other. There are no two equal pairs in this list.

Output

Print one integer — the number of non-empty subsets meeting the constraints, taken modulo 998244353.

Examples

Input


3 0
1 1
2 3
1 3


Output


3


Input


3 1
1 1
2 3
1 3
2 3


Output


2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
const int mod = 998244353;
int n, m, ans;
int l[N], r[N], a[N], b[N], delta[N], fac[N], ifac[N], c[N], sum[45][N];
template <typename T>
inline void chkmax(T &x, T y) {
  x = max(x, y);
}
template <typename T>
inline void chkmin(T &x, T y) {
  x = min(x, y);
}
template <typename T>
inline void read(T &x) {
  T f = 1;
  x = 0;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -f;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - '0';
  x *= f;
}
inline void inc(int &x, int y) { x = (x + y) % mod; }
inline void dec(int &x, int y) { x = x - y >= 0 ? x - y : x - y + mod; }
inline int quickpow(int a, int n) {
  int res = 1;
  for (; n; n >>= 1, a = 1LL * a * a % mod)
    if (n & 1) res = 1LL * res * a % mod;
  return res;
}
inline int binom(int n, int m) {
  if (m < 0) return 0;
  if (n < m)
    return 0;
  else
    return 1LL * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
int main() {
  read(n);
  read(m);
  for (int i = 1; i <= n; ++i) {
    read(l[i]);
    read(r[i]);
    ++delta[l[i]], --delta[r[i] + 1];
  }
  fac[0] = 1;
  for (int i = 1; i <= n; ++i) fac[i] = 1LL * fac[i - 1] * i % mod;
  ifac[n] = quickpow(fac[n], mod - 2);
  for (int i = n - 1; i >= 0; --i) ifac[i] = 1LL * ifac[i + 1] * (i + 1) % mod;
  for (int i = 1; i <= m; ++i) {
    read(a[i]);
    read(b[i]);
  }
  for (int i = 1; i <= n; ++i) delta[i] += delta[i - 1];
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= 2 * m; ++j)
      sum[j][i] = (sum[j][i - 1] + binom(delta[i] - j, i - j)) % mod;
  }
  for (int s = 0; s < (1 << m); ++s) {
    set<int> S;
    S.clear();
    int lef = 1, rig = n;
    for (int i = 1; i <= m; ++i)
      if (s & (1 << (i - 1))) {
        S.insert(a[i]);
        S.insert(b[i]);
        chkmax(lef, l[a[i]]);
        chkmax(lef, l[b[i]]);
        chkmin(rig, r[a[i]]);
        chkmin(rig, r[b[i]]);
      }
    int have = (int)S.size();
    int tmp = (lef <= rig)
                  ? 1LL * (sum[have][rig] - sum[have][lef - 1] + mod) % mod
                  : 0;
    if (__builtin_popcount(s) & 1)
      dec(ans, tmp);
    else
      inc(ans, tmp);
  }
  printf("%d\n", ans);
  return 0;
}