#include<bits/stdc++.h>
using namespace std;
const int N = 1005, MOD = 1e9 + 7;
int n, m, lim, d[N], p[N], msk[N], f[1 << 22];
bool vis[N], e[N][N];
vector <int> vt;
int dfs(int mask, int pos){
	if(!mask)
		return 1;
	if(mask < lim && ~f[mask])
		return f[mask];
	if(!(mask >> pos) & 1)
		return dfs(mask, pos - 1);
	if(mask >= lim)
		return (dfs(mask ^ (1 << pos), pos - 1) + dfs(mask & msk[pos], pos - 1)) % MOD;
	return f[mask] = ((dfs(mask ^ (1 << pos), pos - 1) + dfs(mask & msk[pos], pos - 1)) % MOD);
}
int solve(){
	for(int i = 0; i < vt.size(); i++)
		for(int j = 0; j < vt.size(); j++)
			msk[i] |= (int)e[vt[i]][vt[j]] << j;
	lim = (1 << (vt.size() / 2));
	memset(f, -1, sizeof(int) * lim);
	return dfs((1 << vt.size()) - 1, vt.size() - 1);
}
int main(){
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		p[i] = i;
	for(int i = 1, u, v; i <= m; i++){
		cin >> u >> v;
		e[u][v] = e[v][u] = 1, d[u]++, d[v]++;
	}
	sort(p + 1, p + n + 1, [](int x, int y){return d[x] < d[y];});
	int ans = 0;
	for(int i = 1; i <= n; i++){
		vis[p[i]] = 1;
		vt.clear();
		for(int j = i + 1; j <= n; j++)
			if(e[p[i]][p[j]])
				vt.push_back(p[j]);
		ans = (ans + solve()) % MOD;
	}
	cout << ans << "\n";
	return 0;
}