#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MOD=1e9+7;
int dp[1<<15],f[1<<15][2];
//dp[S]: S is a SCC, f[S][0/1]: S contains even/odd SCCs
int s[256],t[256],p[256];
signed main() {
	int n,m;
	scanf("%lld%lld",&n,&m);
	for(int i=0;i<m;++i) scanf("%lld%lld",&s[i],&t[i]),--s[i],--t[i];
	for(int i=p[0]=1;i<=m;++i) p[i]=p[i-1]*2%MOD;
	f[0][0]=1;
	auto cnt=[&](int S,int T) {
		//edge from S to T
		int res=0;
		for(int i=0;i<m;++i) if((S&(1<<s[i]))&&(T&(1<<t[i]))) ++res;
		return res;
	};
	for(int S=1;S<(1<<n);++S) {
		dp[S]=p[cnt(S,S)];
		for(int T=S,lb=S&-S;T;T=(T-1)&S) if(T!=S&&(T&lb)) {
			f[S][0]=(f[S][0]+dp[T]*f[S^T][1])%MOD;
			f[S][1]=(f[S][1]+dp[T]*f[S^T][0])%MOD;
		}
		for(int T=S;T;T=(T-1)&S) {
			//T are source SCCs
			dp[S]=(dp[S]+(f[T][0]+MOD-f[T][1])*p[cnt(S,S^T)])%MOD;
		}
		f[S][1]=(f[S][1]+dp[S])%MOD; //S has 1 SCC
	}
	printf("%lld\n",dp[(1<<n)-1]);
	return 0;
}