#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
#define int long long 
const int H=(1<<19)+5,mod=1e9+7,N=1000;
int f[H],R,Lim,vis[H];
int st[N],id[N],n,m,du[N];
struct node{int x,y;}a[N];
vector<int>G[N],V[N];
int inc(int a,int b){a+=b;return a>=mod?a-mod:a;}
int DP(int S){
	if(!S)return 1;
	if(S<=R&&vis[S])return f[S];
	int it=0,I;
	for(I=40;I>=0;I--){
		if((S>>I)&1){it=I;break;}
	}
	int v1=DP(S^(1ll<<it));
	int s=0,u=st[it];
	for(int e:G[u]){
		if(id[e]!=-1)s|=(1<<id[e]);
	}
	int v2=DP(S&s);
	if(S<=R)f[S]=inc(v1,v2),vis[S]=1;
	return inc(v1,v2);
}
signed main(){
	int i,j;
	scanf("%lld%lld",&n,&m);
	for(i=1;i<=m;i++){
		scanf("%lld%lld",&a[i].x,&a[i].y);
		du[a[i].x]++;du[a[i].y]++;
		G[a[i].x].push_back(a[i].y);
		G[a[i].y].push_back(a[i].x);
	}
	for(i=1;i<=m;i++){
		if(du[a[i].x]<du[a[i].y]||(du[a[i].x]==du[a[i].y]&&a[i].x<a[i].y)){
			V[a[i].x].push_back(a[i].y);
		}
		else V[a[i].y].push_back(a[i].x);
	}
	int ans=0;
	for(i=1;i<=n;i++){
		int c=0;
		for(j=1;j<=n;j++)id[j]=-1,st[c]=0;
		
		for(int e:V[i]){id[e]=c;st[c]=e;c++;}
		Lim=(1<<c)-1,R=(1<<(c/2))-1;
		for(j=0;j<=R;j++)f[j]=vis[j]=0;
		ans=inc(ans,DP(Lim));
	}
	printf("%lld",ans);
}