#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define ll long long
using namespace std;
const int N=33,mo=1e9+7;
int n,m,e[N][N];
map<int,int>mp;
void add(int &x,int y){x+=y;if(x>=mo)x-=mo;}
int dfs(int x)
{
	if(!x) return 1;
	if(mp.count(x)) return mp[x];
	int y=x&(x-1),s=0;
	int z=__builtin_ctz(x);
	fu(i,z+1,n) if(((y>>i)&1)&&e[z][i]) add(s,dfs(y^(1<<i)));
	return mp[x]=s;
}
int main()
{
	scanf("%d%d",&n,&m);
	fo(i,1,m)
	{
		int x,y;scanf("%d%d",&x,&y);x--;y--;
		e[x][y]=e[y][x]=1;
	}
	printf("%d",dfs((1<<n)-1));
}