#include<bits/stdc++.h>
using namespace std;
int n,m;
typedef long long ll;
const int mod=1e9+7;
inline int add(int a,int b){a+=b;return a>=mod?a-mod:a;}
inline int sub(int a,int b){a-=b;return a<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
int e[20];
int f[1<<16];

int main()
{
	cin >> n >> m;
	for(int i=1,u,v;i<=m;i++){
		scanf("%d%d",&u,&v);--u,--v;
		e[u]|=1<<v;
	}
	f[0]=1;
	for(int i=3;i<1<<n;i++)if((i&1)==((i&2)>>1)){
		for(int j=i;j;j=(j-1)&i)if((j&1)==((j&2)>>1)){
			int T0=j,T1=i^j,w=1;
			for(int id=0;id<n;id++)if(1&(i>>id)){
				if(1&(T0>>id)) w=mul(w,1<<(__builtin_popcount(e[id]&T1)));
				else w=mul(w,(1<<(__builtin_popcount(e[id]&T0)))-1);
			}
			f[i]=add(f[i], mul(f[T1],w));
		}
	}
	int tot=1;
	for(int i=1;i<=m;i++)tot=mul(tot,2);
	cout << sub(tot,f[(1<<n)-1]) << endl;
}
