Problem: You have been hired to supervise the project of a new amusement park. The park will have a special gimmick: directed slides that can get customers from one attraction to another quickly and in an entertaining way.

The park owner has given you the current project: a list of planned attractions and a list of slides that should be built between them. However, him being a businessman, he casually envisioned the impossible: among other things, he projected a slide coming from the Haunted Castle to the Roller Coaster, another from the Roller Coaster to the Drop Tower, and a third from the Drop Tower to the Haunted Castle. As the slides can only go downhill, it is evident why this is a problem. You don't have the luxury of ignoring the laws of physics when building the park, so you have to request changes in the project. Maybe he would accept reversing the slide between the Drop Tower and the Haunted Castle?

Formally: 

  * The project is a list of attractions and a list of directed slides. Each slide starts at one attraction and ends at another attraction. 
  * A proposal is obtained from the project by reversing the directions of some slides (possibly none or all of them). 
  * A proposal is legal if there is a way to assign an elevation to each attraction in such a way that every slide goes downhill. 
  * The cost of a proposal is the number of slides whose directions were reversed. 



For a given project, find and report the sum of costs all legal proposals. Since this number may be large, output it modulo 998,244,353.

Input

The first line contains two space-separated integers n, m (1 ≤ n ≤ 18, 0 ≤ m ≤ n(n-1)/2) – the number of attractions and the number of slides, respectively. The attractions are numbered 1 through n.

Then, m lines follow. The i-th of these lines contains two space-separated integers a_i, b_i (1 ≤ a_i, b_i ≤ n) denoting a slide from a_i to b_i. 

You may assume that: 

  * There are no self-loops. (For each i: a_i ≠ b_i.) 
  * No slide appears twice. (For all i ≠ j: a_i ≠ a_j or b_i ≠ b_j.) 
  * No pair of attractions is connected in both directions. (The unordered pairs \\{a_i, b_i\} are distinct.) 

Output

Output one line with a single integer, the sum of costs of all legal proposals modulo 998,244,353.

Scoring

Subtask 1 (7 points): n ≤ 3

Subtask 2 (12 points): n ≤ 6

Subtask 3 (23 points): n ≤ 10

Subtask 4 (21 points): n ≤ 15

Subtask 5 (37 points): no additional constraints

Examples

Input


2 1
1 2


Output


1


Input


3 3
1 2
2 3
1 3


Output


9

Note

In the first example, there are two proposals: 

  * The slide direction is not flipped. This proposal has cost 0. 
  * The slide direction is flipped. This proposal has cost 1. 

As both proposals are valid, the answer is 0 + 1 = 1.

In the second example, there are eight proposals with the slide directions as follows: 

  * 1 → 2, 2 → 3, 1 → 3 (cost 0) 
  * 1 → 2, 2 → 3, 3 → 1 (cost 1) 
  * 1 → 2, 3 → 2, 1 → 3 (cost 1) 
  * 1 → 2, 3 → 2, 3 → 1 (cost 2) 
  * 2 → 1, 2 → 3, 1 → 3 (cost 1) 
  * 2 → 1, 2 → 3, 3 → 1 (cost 2) 
  * 2 → 1, 3 → 2, 1 → 3 (cost 2) 
  * 2 → 1, 3 → 2, 3 → 1 (cost 3) 



The second proposal is not legal, as there is a slide sequence 1 → 2 → 3 → 1. This means that the attraction 1 has to be strictly higher than ifself, which is clearly impossible. Similarly, the seventh proposal is not legal. The answer is thus 0 + 1 + 2 + 1 + 2 + 3 = 9.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 9, mod = 998244353;
template <int32_t MOD>
struct modint {
  int32_t value;
  modint() = default;
  modint(int32_t value_) : value(value_) {}
  inline modint<MOD> operator+(modint<MOD> other) const {
    int32_t c = this->value + other.value;
    return modint<MOD>(c >= MOD ? c - MOD : c);
  }
  inline modint<MOD> operator-(modint<MOD> other) const {
    int32_t c = this->value - other.value;
    return modint<MOD>(c < 0 ? c + MOD : c);
  }
  inline modint<MOD> operator*(modint<MOD> other) const {
    int32_t c = (int64_t)this->value * other.value % MOD;
    return modint<MOD>(c < 0 ? c + MOD : c);
  }
  inline modint<MOD> &operator+=(modint<MOD> other) {
    this->value += other.value;
    if (this->value >= MOD) this->value -= MOD;
    return *this;
  }
  inline modint<MOD> &operator-=(modint<MOD> other) {
    this->value -= other.value;
    if (this->value < 0) this->value += MOD;
    return *this;
  }
  inline modint<MOD> &operator*=(modint<MOD> other) {
    this->value = (int64_t)this->value * other.value % MOD;
    if (this->value < 0) this->value += MOD;
    return *this;
  }
  inline modint<MOD> operator-() const {
    return modint<MOD>(this->value ? MOD - this->value : 0);
  }
  modint<MOD> pow(uint64_t k) const {
    modint<MOD> x = *this, y = 1;
    for (; k; k >>= 1) {
      if (k & 1) y *= x;
      x *= x;
    }
    return y;
  }
  modint<MOD> inv() const { return pow(MOD - 2); }
  inline modint<MOD> operator/(modint<MOD> other) const {
    return *this * other.inv();
  }
  inline modint<MOD> operator/=(modint<MOD> other) {
    return *this *= other.inv();
  }
  inline bool operator==(modint<MOD> other) const {
    return value == other.value;
  }
  inline bool operator!=(modint<MOD> other) const {
    return value != other.value;
  }
};
template <int32_t MOD>
modint<MOD> operator*(int64_t value, modint<MOD> n) {
  return modint<MOD>(value) * n;
}
template <int32_t MOD>
modint<MOD> operator*(int32_t value, modint<MOD> n) {
  return modint<MOD>(value % MOD) * n;
}
template <int32_t MOD>
ostream &operator<<(ostream &out, modint<MOD> n) {
  return out << n.value;
}
using mint = modint<mod>;
const int V = 18;
struct ChromaticPolynomial {
  int n;
  mint nCr(int n, int k) {
    if (n < 0) return 0;
    if (n - k < k) k = n - k;
    if (k < 0) return 0;
    mint ret = 1;
    for (int i = 0; i < k; ++i) ret *= n - i, ret /= i + 1;
    return ret;
  }
  void bitflip(vector<mint> &v) {
    for (int i = 1, j = 0; i < n; ++i) {
      int m = n >> 1;
      for (; j >= m; m >>= 1) j -= m;
      j += m;
      if (i < j) swap(v[i], v[j]);
    }
  }
  void fmt(vector<mint> &vec, bool inv) {
    int n = vec.size();
    for (int iter = 1, sh = 0; iter < n; iter *= 2, ++sh) {
      for (int x = 0; x < n; x += 2 * iter) {
        for (int y = 0; y < iter; ++y) {
          mint v = vec[x + y], w = vec[x + y + iter];
          vec[x + y + iter] = inv ? w - v : v + w;
        }
      }
    }
  }
  vector<mint> polynomial(vector<bitset<V>> g) {
    if (!n) {
      vector<mint> ans(n + 1);
      fill(ans.begin(), ans.end(), 1);
      return ans;
    }
    vector<vector<mint>> f(n + 1, vector<mint>(1 << n));
    for (int m = 1; m < (1 << n); ++m) {
      bitset<V> bs(0);
      bool fail = 0;
      for (int i = 0; i < n; ++i) {
        if ((m >> i) & 1) {
          if (bs[i]) fail = 1;
          bs |= g[i];
        }
      }
      if (!fail) f[__builtin_popcount(m)][m] = 1;
    }
    for (auto &e : f) fmt(e, 0);
    vector<vector<mint>> f_cur(n + 1, vector<mint>(1 << n));
    auto f_next = f_cur;
    f_cur[0][0] = 1;
    fmt(f_cur[0], 0);
    vector<mint> ans(n + 1, 0);
    vector<mint> tmp(1 << n);
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j <= n; ++j) {
        auto &e = f_next[j];
        fill(tmp.begin(), tmp.end(), 0);
        for (int k = 0; k <= j; ++k) {
          for (int l = 0; l < (1 << n); ++l)
            tmp[l] += f_cur[j - k][l] * f[k][l];
        }
        for (int l = 0; l < (1 << n); ++l) e[l] = tmp[l];
      }
      f_next.swap(f_cur);
      auto cnts = f_cur[n];
      fmt(cnts, 1);
      for (int j = 0; j <= n; ++j) ans[j] += nCr(j, i + 1) * cnts.back();
    }
    return ans;
  }
  vector<mint> p;
  void init(vector<bitset<V>> g) {
    n = g.size();
    p = polynomial(g);
  }
  mint get(long long c) {
    if (c >= 0 && c < (int)p.size()) return p[c];
    c = (c % mod + mod) % mod;
    mint ans = 0;
    for (int i = 0; i <= n; ++i) {
      mint mul = p[i];
      for (int j = 0; j <= n; ++j)
        if (j != i) {
          mul *= mint(c) - mint(j);
          mul /= mint(i) - mint(j);
        }
      ans += mul;
    }
    return ans;
  }
} C;
vector<int> g[N];
int32_t main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    --u;
    --v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  vector<bitset<V>> e(n);
  for (int u = 0; u < n; u++)
    for (auto v : g[u]) e[u][v] = 1;
  C.init(e);
  mint ans = C.get(-1);
  ans *= n & 1 ? -1 : 1;
  ans *= m;
  ans /= 2;
  cout << ans << '\n';
  return 0;
}