#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 1005, M = (1 << 22) + 5, mod = 1e9 + 7;
int n, m, du[N], tot, ver[N];
bool g[N][N];
long long ans, f[M], e[50];
void FWT (int len, long long *a) {
    for (int i = 0; i < len; i++) {
        for (int S = 0; S < (1 << len); S++) if ((S >> i) & 1) a[S] = (a[S] + a[S ^ (1 << i)]) % mod;
    }
}
int main() {
    scanf ("%d%d", &n, &m);
    for (int i = 1, u, v; i <= m; i++) {
        scanf ("%d%d", &u, &v);
        g[u][v] = g[v][u] = 1;
        du[u]++, du[v]++;
    }
    for (int i = 1; i <= n; i++) g[i][i] = 1;
    for (int u = 1; u <= n; u++) if (du[u] <= 45) {
        tot = 0;
        for (int v = 1; v <= n; v++) if (g[u][v] && (du[v] > du[u] || (du[v] == du[u] && v > u))) ver[tot++] = v;
        int mid = tot / 2;
        for (int i = 0; i < tot; i++) {
            int v = ver[i];
            e[i] = 0;
            for (int j = 0; j < tot; j++) if (g[v][ver[j]]) e[i] |= (1ll << j);
        }
        for (int S = 0; S < (1 << mid); S++) {
            long long nw = (1ll << tot) - 1;
            for (int i = 0; i < mid; i++) if ((S >> i) & 1) nw &= e[i];
            f[S] = ((nw & S) == S);
        } 
        FWT(mid, f);
        for (long long S = 0; S < (1ll << tot); S += (1 << mid)) {
            long long nw = (1ll << tot) - 1;
            for (int i = mid; i < tot; i++) if ((S >> i) & 1) nw &= e[i];
            if ((nw & S) == S) ans = (ans + f[(nw - S) & ((1 << mid) - 1)]) % mod;
        }
    }
    printf ("%lld\n", ans);
    return 0;
}