#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int mod = 1e9 + 7;

int n, m, d[200200], c[200200];

ll f[200200], r[200200];

ll pw(ll n, ll k) {
    ll re = 1, g = n;
    while(k) {
        if(k & 1) re = (re * g) % mod;
        k >>= 1, g = g * g % mod;
    }
    return re;
}

ll C(ll n, ll k) {
    return f[n] * pw(f[k], mod-2) % mod * pw(f[n-k], mod-2) % mod;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    vector<array<int, 2>> e(m);
    for(auto &[x, y] : e) cin >> x >> y, d[x]++, d[y]++;
    int mn = n;
    for(auto [x, y] : e) {
        if(d[x] > d[y]) swap(x, y);
        mn = min(mn, d[y]);
    }
    f[0] = 1;
    for(int i=1;i<=n;i++) c[d[i]]++, f[i] = f[i-1]*i%mod;

    ll N = n, M = m+m;
    ll ans = M == N*(N-1);

    for(int i=0;i<n;i++) {
        for(int j=1;j<=c[i];j++) {
            N--, M -= i;
            if(M-N*(N-1) == m+m-M) ans = (ans + C(c[i], j)) % mod;
        }
    }
    cout << ans;
}