#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
#define gcd(x,y) __gcd(unsigned(x),unsigned(y))
const int MOD=int(1e9)+7;
LL msk[100];
int n,m,lk[1010][1010],deg[1010],pos[1010];
int f[1<<25];
int cal(const vector<int>&V)
{
    int n=V.size();
    if(n==0||n==1)return n+1;
    int m=(n+1)/2;
    for(int j=0;j<n;j++)
    {
        msk[j]=1ll<<j;
        for(int i=0;i<n;i++)if(lk[V[j]][V[i]])msk[j]|=1ll<<i;
    }
    for(int i=0;i<(1<<(n-m));i++)
    {
        f[i]=0;
        LL all=(1ll<<n)-1;
        for(int j=0;j<(n-m);j++)
        if((i>>j)&1)
        all&=msk[j+m];
        all>>=m;
        if((all&i)!=i)continue;
        f[i]=1;
    }
    for(int j=0;j<n-m;j++)
    for(int i=0;i<(1<<(n-m));i++)
    if((i>>j)&1)f[i]=(f[i]+f[i^(1<<j)])%MOD;
    int ans=0;
    for(int i=0;i<(1<<m);i++)
    {
        LL all=(1ll<<n)-1;
        for(int j=0;j<m;j++)
        if((i>>j)&1)
        all&=msk[j];
        if((all&i)!=i)continue;
        all>>=m;
        ans=(ans+f[all])%MOD;
    }
    return ans;
}
int main()
{
    scanf("%d%d",&n,&m);
    rep(i,m){int x,y;scanf("%d%d",&x,&y);lk[x][y]=lk[y][x]=1;deg[x]++;deg[y]++;}
    rep(i,n)pos[i]=i;
    sort(pos+1,pos+n+1,[&](int x,int y){return deg[x]<deg[y];});
    int ans=0;
    rep(i,n)
    {
        int x=pos[i];
        vector<int>V;
        for(int j=i+1;j<=n;j++)if(lk[x][pos[j]])V.pb(j);
        ans=(ans+cal(V))%MOD;
    }
    printf("%d\n",ans);
    return 0;
}