#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int MOD = 1e9 + 7;

int add(int a, int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}

const int MAXK = 24;
bitset<(1 << MAXK)> is_clique;
int sum[1 << MAXK], rgh[1 << MAXK];

int16_t ind[1 << MAXK];

int count(vector<int> g) {
    int n = g.size();
    if (n == 1) return 2;
    int m = n / 2;
    sum[0] = 1;
    for (int mask = 1; mask < (1 << (n - m)); ++mask) {
        int i = ind[mask];
        sum[mask] = add(sum[mask ^ (1 << i)], sum[mask & (g[i + m] >> m)]);
    }
    int ans = sum[(1 << (n - m)) - 1];
    is_clique[0] = 1;
    rgh[0] = (1 << (n - m)) - 1;
    for (int mask = 1; mask < (1 << m); ++mask) {
        int i = ind[mask];
        rgh[mask] = rgh[mask ^ (1 << i)] & (g[i] >> m);
        is_clique[mask] = is_clique[mask ^ (1 << i)];
        if ((g[i] & mask) != (mask ^ (1 << i))) {
            is_clique[mask] = 0;
        }
        if (is_clique[mask]) {
            ans = add(ans, sum[rgh[mask]]);
        }
    }
    return ans;
}

const int MAXN = 1e3 + 100;
int g[MAXN][MAXN];
int deg[MAXN];

int count_ind(vector<int> ind) {
    int n = ind.size();
    vector<int> g1(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (g[ind[i]][ind[j]]) {
                g1[i] |= (1 << j);
            }
        }
    }
    return count(g1);
}

const int D = 42;
bool is_deleted[MAXN];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    for (int i = 1; i < (1 << MAXK); ++i) {
        ind[i] = __lg(i ^ (i & (i - 1)));
    }

    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        g[u][v] = g[v][u] = 1;
        ++deg[u];
        ++deg[v];
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        if (deg[i] <= D) {
            vector<int> ind;
            for (int j = 0; j < n; ++j) {
                if (!is_deleted[j] && g[i][j]) {
                    ind.push_back(j);
                }
            }
            ans = add(ans, count_ind(ind));
            is_deleted[i] = true;
        }
    }
    vector<int> ind;
    for (int i = 0; i < n; ++i) {
        if (!is_deleted[i]) {
            ind.push_back(i);
        }
    }
    ans = add(ans, count_ind(ind));
    cout << add(ans, MOD - 1) << "\n";
    return 0;
}