//#pragma GCC optimize(2)
#include<algorithm>
#include<stdlib.h>
#include<iostream>
#include<cassert>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<vector>
#include<cstdio>
#include<random>
#include<bitset>
#include<queue>
#include<cmath>
#include<set>
#include<map>
//#include<bits/stdc++.h>
#define uint unsigned int
#define int long long
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define lll __int128
#define db double
#define ld long double
#define pii pair<int,int>
#define For(i,l,r) for(int i=(l);i<=(r);++i)
#define rof(i,r,l) for(int i=(r);i>=(l);--i)
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
#define lowbit(t) (t&-t)
#define ckmax(a,b) a=max(a,b)
#define ckmin(a,b) a=min(a,b)
#define ppct(t) __builtin_popcount(t)
#define x1 xxx111
#define y1 yyy111
#define x2 xxx222
#define y2 yyy222
using namespace std;
const int N=1e3+10,M=1<<23,inf=1e18,mod=1e9+7;
int n,m;
int du[N];
bool e[N][N];
int edge[N];
vector<int>vec;
int f[M];
int ans=0;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    For(i,1,n)e[i][i]=1;
    For(i,1,m){
        int u,v;
        cin>>u>>v;
        e[u][v]=e[v][u]=1;
        ++du[u];
        ++du[v];
    }
    For(x,1,n){
        vec.clear();
        For(y,1,n)
            if((du[x]<du[y]||(du[x]==du[y]&&y<x))&&e[x][y])
                vec.push_back(y);
        int mid=vec.size()>>1,sz=vec.size();
        For(i,0,sz-1){
            edge[i]=0;
            For(j,0,sz-1){
                int x=vec[i],y=vec[j];
                if(e[x][y])edge[i]|=(1<<j);
            }
        }
        int full=(1<<sz)-1;
        For(st,0,(1<<mid)-1){
            int to=full;
            For(i,0,mid-1){
                if((st>>i)&1){
                    if((to&st)!=st)break;
                    to&=edge[i];
                }
            }
            f[st]=(int)((to&st)==st);
        }
        For(i,0,mid-1){
            For(st,0,(1<<mid)-1){
                if((st>>i)&1){
                    f[st]=(f[st]+f[st^(1<<i)])%mod;
                }
            }
        }
        for(int st=0;st<=full;st+=(1<<mid)){
            int to=full;
            For(i,mid,sz-1){
                if((st>>i)&1){
                    to&=edge[i];
                    if((to&st)!=st)break;
                }
            }
            if((to&st)==st)ans=(ans+f[(to-st)&((1<<mid)-1)])%mod;
        }
    }
    cout<<ans<<endl;
    return 0;
}
/*
 3 2
 1 2
 2 3
 
 3 3
 1 2
 1 3
 2 3
 */