bool M1;
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<" MB\n"
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <cstring>
#include <array>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
#include <ctime>
#include <cstdlib>
#include <random>
#include <set>
#include <ctime>
#include <map>
#include <stack>
#include <unordered_map>
#include <assert.h>
#define i128 __int128
#define ll long long
#define uint unsigned
#define ull unsigned long long
#define reg register
#define fo(a,b,c) for(reg ll a=b;a<=c;++a)
#define re(a,b,c) for(reg ll a=b;a>=c;--a)
#define pii pair<ll,ll>
#define pdd pair<db,db>
#define fi first
#define pb push_back
#define se second
#define ite set<ll> ::iterator
using namespace std;
const ll mod=1e9+7;
inline ll gi()
{
	ll x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9')
	{
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9')
	{
		x = (x<<1) + (x<<3) + (ch^48);
		ch = getchar();
	}
	return x * f;
}
ll _=1;
const ll inf=1e17+5,iinf=2e9;
const ll N=16,M=(1<<15);
ll dp[M],dpj[M],dpo[M],lk[N],pw[N*N],nb[M],pcnt[M];
ll lb(ll x)
{
	return x&-x;
}
void sol()
{
	ll n=gi(),m=gi();
	ll all=(1<<n)-1;
	pw[0]=1;
	fo(i,1,n*n) pw[i]=pw[i-1]*2%mod;
	fo(i,1,all)
	{
		pcnt[i]=pcnt[i/2];
		if(i&1) pcnt[i]++;
	}
	fo(i,1,m)
	{
		ll x=gi(),y=gi();
		fo(j,0,all)
		{
			if(j&(1<<x-1))
			{
				if(j&(1<<y-1)) nb[j]++;
			}
		}
		lk[x]|=(1<<y-1);
	}
	dpo[0]=1;
	dp[0]=1;
	fo(i,1,all)
	{
		dp[i]=pw[nb[i]];
		ll zlb=lb(i);
		for(ll x=(i-1)&i;x;x=(x-1)&i)
		{
			ll coe=dpj[x]-dpo[x];
			coe%=mod;
			ll num=0;
			fo(j,1,n)
			{
				if(i&(1<<j-1))
				{
					num+=pcnt[lk[j]&(i-x)];
				}
			}
			
//			cout<<i<<" "<<x<<" "<<num<<'\n';
			coe=coe*pw[num]%mod;
			dp[i]-=coe;
			dp[i]%=mod;
			if((x&zlb)==0) continue;
			dpj[i]+=dpo[i-x]*dp[x]%mod;
			dpj[i]%=mod;
			dpo[i]+=dpj[i-x]*dp[x]%mod;
			dpo[i]%=mod;
		}
		dp[i]-=(dpj[i]-dpo[i]);
		dp[i]%=mod;
		dpj[i]+=dp[i];
		dpj[i]%=mod;
	}
	ll ans=dp[all];
	ans+=mod;
	ans%=mod;
	cout<<ans;
}
bool M2;
int main()
{
	int Time=clock();
	look_memory;
//	_=gi();
	while(_--)
	{
		sol();
		printf("\n");
	}
	look_time;
	return 0;
}