#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 400'010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


// gg: bipartite graph between {vertex} and {biconnected component}
//   (|gg| - n) biconnected components
//   isolated point: not regarded as biconnected component (==> isolated in gg)
// f: DFS out-forest
// ess: edges in biconnected component
//   (u, v) with dis[u] <= dis[v]
//   self-loop at isolated point: not included in ess
struct Biconnected {
  int n, m;
  vector<vector<int>> g, f, gg;
  vector<vector<pair<int, int>>> ess;
  vector<int> par, rs;
  int zeit;
  vector<int> dis, fin, low;

  Biconnected() {}
  explicit Biconnected(int n_) : n(n_), m(0), g(n_) {}
  void ae(int u, int v) {
    ++m;
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    g[u].push_back(v);
    if (u != v) g[v].push_back(u);
  }

  int stackVLen, stackELen;
  vector<int> stackV;
  vector<pair<int, int>> stackE;
  vector<int> cntPar;
  void dfs(int u) {
    stackV[stackVLen++] = u;
    dis[u] = low[u] = zeit++;
    for (const int v : g[u]) {
      if (par[u] == v && !cntPar[u]++) continue;
      if (~dis[v]) {
        if (dis[u] >= dis[v]) stackE[stackELen++] = std::make_pair(v, u);
        if (low[u] > dis[v]) low[u] = dis[v];
      } else {
        f[u].push_back(v);
        par[v] = u;
        rs[v] = rs[u];
        const int stackEPos = stackELen;
        stackE[stackELen++] = std::make_pair(u, v);
        dfs(v);
        if (low[u] > low[v]) low[u] = low[v];
        if (dis[u] <= low[v]) {
          const int x = gg.size();
          gg.emplace_back();
          ess.emplace_back();
          for (; ; ) {
            const int w = stackV[--stackVLen];
            gg[w].push_back(x);
            gg[x].push_back(w);
            if (w == v) break;
          }
          gg[u].push_back(x);
          gg[x].push_back(u);
          for (; stackELen > stackEPos; ) ess[x].push_back(stackE[--stackELen]);
        }
      }
    }
    fin[u] = zeit;
  }
  void build() {
    f.assign(n, {});
    gg.assign(n, {});
    ess.assign(n, {});
    par.assign(n, -1);
    rs.assign(n, -1);
    zeit = 0;
    dis.assign(n, -1);
    fin.assign(n, -1);
    low.assign(n, -1);
    stackV.resize(n);
    stackE.resize(m);
    cntPar.assign(n, 0);
    for (int u = 0; u < n; ++u) if (!~dis[u]) {
      stackVLen = stackELen = 0;
      rs[u] = u;
      dfs(u);
    }
  }

  // Returns true iff u is an articulation point
  //   <=> # of connected components increases when u is removed.
  inline bool isArt(int u) const {
    return (gg[u].size() >= 2);
  }

  // Returns w s.t. w is a child of u and a descendant of v in the DFS forest.
  // Returns -1 instead if v is not a proper descendant of u
  //   O(log(deg(u))) time
  int dive(int u, int v) const {
    if (dis[u] < dis[v] && dis[v] < fin[u]) {
      int j0 = 0, j1 = f[u].size();
      for (; j0 + 1 < j1; ) {
        const int j = (j0 + j1) / 2;
        ((dis[f[u][j]] <= dis[v]) ? j0 : j1) = j;
      }
      return f[u][j0];
    } else {
      return -1;
    }
  }
  // Returns true iff there exists a v-w path when u is removed.
  //   O(log(deg(u))) time
  bool isStillReachable(int u, int v, int w) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(0 <= w); assert(w < n);
    assert(u != v);
    assert(u != w);
    if (rs[v] != rs[w]) return false;
    if (rs[u] != rs[v]) return true;
    const int vv = dive(u, v);
    const int ww = dive(u, w);
    if (~vv) {
      if (~ww) {
        return (vv == ww || (dis[u] > low[vv] && dis[u] > low[ww]));
      } else {
        return (dis[u] > low[vv]);
      }
    } else {
      if (~ww) {
        return (dis[u] > low[ww]);
      } else {
        return true;
      }
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


int N, M;
vector<int> A, B;


namespace brute {
Mint run() {
cerr<<"[brute::run]"<<endl;
  vector<int> ps(N);
  for (int u = 0; u < N; ++u) {
    ps[u] = u;
  }
  int ans = 0;
  vector<pair<int, int>> qs(M);
  do {
    if (ps[0] < ps[1]) {
      for (int i = 0; i < M; ++i) {
        qs[i] = make_pair(ps[A[i]], ps[B[i]]);
        if (qs[i].first > qs[i].second) {
          swap(qs[i].first, qs[i].second);
        }
      }
      sort(qs.begin(), qs.end());
      for (int i = 0; i < M; ++i) for (int j = i + 1; j < M; ++j) {
        if (qs[i].first < qs[j].first && qs[j].first < qs[i].second && qs[i].second < qs[j].second) {
          goto failed;
        }
      }
      ++ans;
     failed:{}
    }
  } while (next_permutation(ps.begin(), ps.end()));
  ans *= 2;
  return ans;
}
}  // brute


namespace sub2 {
Mint run() {
cerr<<"[sub2::run]"<<endl;
  vector<int> deg(N, 0);
  for (int i = 0; i < M; ++i) {
    ++deg[A[i]];
    ++deg[B[i]];
  }
  Mint ans = N;
  for (int u = 0; u < N; ++u) {
    ans *= fac[deg[u]];
  }
  return ans;
}
}  // sub2


namespace sub3 {
Mint run() {
cerr<<"[sub3::run]"<<endl;
  vector<vector<int>> graph(N);
  for (int i = 0; i < M; ++i) {
    graph[A[i]].push_back(B[i]);
    graph[B[i]].push_back(A[i]);
  }
  vector<int> deg(N, 0);
  for (int u = 0; u < N; ++u) {
    deg[u] = graph[u].size();
  }
  queue<int> que;
  vector<int> on(N, 1);
  for (int u = 0; u < N; ++u) if (deg[u] == 1) {
    que.push(u);
  }
  for (; que.size(); ) {
    const int u = que.front();
    que.pop();
    on[u] = 0;
    for (const int v : graph[u]) if (on[v]) {
      if (--deg[v] == 1) {
        que.push(v);
      }
    }
  }
  for (int u = 0; u < N; ++u) {
    deg[u] = graph[u].size();
  }
  Mint ans = 2 * N;
  for (int u = 0; u < N; ++u) {
    ans *= fac[deg[u] - on[u]];
  }
  return ans;
}
}  // sub3


namespace sub5 {
Mint run() {
cerr<<"[sub5::run]"<<endl;
  Biconnected G(N);
  for (int i = 0; i < M; ++i) {
    G.ae(A[i], B[i]);
  }
  G.build();
// cerr<<"gg = "<<G.gg<<endl;
  Mint ans = N;
  for (int x = N; x < (int)G.gg.size(); ++x) {
    if (G.gg[x].size() >= 3) {
      ans *= 2;
    }
  }
  for (int u = 0; u < N; ++u) {
    ans *= fac[G.gg[u].size()];
  }
  return ans;
}
}  // sub5


namespace sub6 {
bool adj[310][310];
vector<int> tri[310][310];

int cnt;
bool dfs(int u, int v, int p) {
  if (u > v) {
    swap(u, v);
  }
  ++cnt;
  if (cnt > M) {
    return false;
  }
  auto ws = tri[u][v];
  {
    auto it = find(ws.begin(), ws.end(), p);
    if (it != ws.end()) {
      ws.erase(it);
    }
  }
  if (ws.size() >= 2) {
    return false;
  } else if (ws.size() == 1) {
    const int w = ws[0];
    if (!dfs(u, w, v)) return false;
    if (!dfs(v, w, u)) return false;
  }
  return true;
}

Mint run() {
cerr<<"[sub6::run]"<<endl;
  memset(adj, 0, sizeof(adj));
  for (int i = 0; i < M; ++i) {
    adj[A[i]][B[i]] = true;
    adj[B[i]][A[i]] = true;
  }
  for (int u = 0; u < N; ++u) for (int v = u + 1; v < N; ++v) {
    tri[u][v].clear();
    if (adj[u][v]) {
      for (int w = 0; w < N; ++w) if (adj[u][w] && adj[v][w]) {
        tri[u][v].push_back(w);
      }
    }
    if (tri[u][v].size() >= 3) {
cerr<<"[sub6] FAIL:"<<__LINE__<<endl;
      return 0;
    }
  }
  for (int u = 0; u < N; ++u) for (int v = u + 1; v < N; ++v) {
    if (tri[u][v].size() == 1) {
      cnt = 0;
      if (!dfs(u, v, -1)) {
cerr<<"[sub6] FAIL:"<<__LINE__<<endl;
        return 0;
      }
      if (cnt != M) {
cerr<<"[sub6] FAIL:"<<__LINE__<<endl;
        return 0;
      }
      goto done;
    }
  }
cerr<<"[sub6] FAIL:"<<__LINE__<<endl;
  return 0;
 done:{}
  return 2 * N;
}
}  // sub6


int main() {
  prepare();
  
  for (; ~scanf("%d%d", &N, &M); ) {
    A.resize(M);
    B.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    
    Mint ans = 0;
    if (M <= 2 * N - 3) {
      if (M == 2 * N - 3) {
        ans = sub6::run();
      } else if (N <= 10) {
        ans = brute::run();
      } else {
        ans = sub5::run();
      }
    }
    printf("%u\n", ans.x);
#ifdef LOCAL
const Mint brt=brute::run();
if(brt!=ans)cerr<<N<<" "<<M<<" "<<A<<" "<<B<<": "<<brt<<" "<<ans<<endl;
assert(brt==ans);
#endif
  }
  return 0;
}