//code by Nobody.Emissary
#include<bits/stdc++.h>

using namespace std;

const int MAXN = 15;
const int mod = 1e9+7;

int f[1<<MAXN], g[1<<MAXN];
int n, m, powc[MAXN*MAXN<<1], sta[MAXN+2];

inline int E(int S, int T){
	int tot=0;
	for(int i=1;i<=n;++i)
		if((S>>(i-1))&1) tot+=__builtin_popcount(T&sta[i]);
	return tot;
}

int main(){
	cin >> n >> m;
	for(int i=1;i<=m;++i){
		int x, y;
		cin >> x >> y;
		sta[x]|=1<<(y-1);
		//sta[y]|=1<<(x-1);
	}
	powc[0]=1; const int S=(1<<n)-1;
	for(int i=1;i<=m;++i) powc[i]=powc[i-1]<<1, powc[i]%=mod;
	for(int i=1;i<=S;++i){
		f[i]=powc[E(i,i)]; int t=i&-i;
		for(int j=i;j;j=(j-1)&i)
			if(!(j&t)) (g[i]+=mod-1ll*g[j]*f[i^j]%mod)%=mod;
		for(int j=i;j;j=(j-1)&i)
			(f[i]+=1ll*powc[E(i^j,i^j)+E(i^j,j)]*g[j]%mod)%=mod;
		(g[i]+=mod-f[i])%=mod;
	//cout << i << ' ' << f[i] << endl;
	}
	cout << f[S] << endl;
	return 0;
}