#include <bits/stdc++.h>


using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


const ll inf = 1e18;
mt19937 rnd(234);
const ll mod = 1e9 + 7;

int n, m;
vector<vector<int>> g;
int usdc;
vector<int> usd;


ll solve(vector<int>& a) {
    int k = (int)a.size();
    if (k == 0) {
        return 1;
    }
    ++usdc;
    for (auto x : a) {
        usd[x] = usdc;
    }
    int mn_deg = k;
    int mni = -1;
    for (int i = 0; i < n; i += 1) {
        int deg = 0;
        int v = a[i];
        for (auto to : g[v]) {
            if (usd[to] == usdc) {
                deg += 1;
            }
        }
        if (deg < mn_deg) {
            mn_deg = deg;
            mni = i;
        }
    }
    if (mn_deg == k - 1) {
        return (1ll << k) % mod;
    }
    vector<int> b;
    int v = a[mni];
    for (auto to : g[v]) {
        if (usd[to] == usdc) {
            b.push_back(to);
        }
    }
    ll rs = solve(b);
    a.erase(a.begin() + mni);
    rs = (rs + solve(a)) % mod;
    return rs;
}


ll solve() {
    usd.assign(n, 0);
    usdc = 1;
    vector<int> a(n);
    for (int i = 0; i < n; i += 1) {
        a[i] = i;
    }
    ll rs = solve(a);
    return (rs + mod - 1) % mod;
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> m;
    g.assign(n, vector<int>());
    for (int i = 0; i < m; i += 1) {
        int u, v;
        cin >> u >> v;
        --u;
        --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    ll rs = solve();
    cout << rs << "\n";
    return 0;
}