There is a directed graph G with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i is directed from x_i to y_i. Here, x_i < y_i holds. Also, there are no multiple edges in G.

Consider selecting a subset of the set of the M edges in G, and removing these edges from G to obtain another graph G'. There are 2^M different possible graphs as G'.

Alice and Bob play against each other in the following game played on G'. First, place two pieces on vertices 1 and 2, one on each. Then, starting from Alice, Alice and Bob alternately perform the following operation:

* Select an edge i such that there is a piece placed on vertex x_i, and move the piece to vertex y_i (if there are two pieces on vertex x_i, only move one). The two pieces are allowed to be placed on the same vertex.



The player loses when he/she becomes unable to perform the operation. We assume that both players play optimally.

Among the 2^M different possible graphs as G', how many lead to Alice's victory? Find the count modulo 10^9+7.

Constraints

* 2 ≤ N ≤ 15
* 1 ≤ M ≤ N(N-1)/2
* 1 ≤ x_i < y_i ≤ N
* All (x_i,\ y_i) are distinct.

Input

Input is given from Standard Input in the following format:


N M
x_1 y_1
x_2 y_2
:
x_M y_M


Output

Print the number of G' that lead to Alice's victory, modulo 10^9+7.

Examples

Input

2 1
1 2


Output

1


Input

3 3
1 2
1 3
2 3


Output

6


Input

4 2
1 3
2 4


Output

2


Input

5 10
2 4
3 4
2 5
2 3
1 2
3 5
1 3
1 5
4 5
1 4


Output

816
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
	T i=0;char c;
	while(!isdigit(c=getchar())&&c!='-');
	bool flag=c=='-';
	flag?c=getchar():0;
	while(i=i*10-'0'+c,isdigit(c=getchar()));
	return flag?-i:i;
}
template<class T1,class T2>inline void apmax(T1 &a,const T2 &b){if(a<b)a=b;}
template<class T1,class T2>inline void apmin(T1 &a,const T2 &b){if(b<a)a=b;}
const int N=15,SN=1<<N,O=1000000007;
inline int fpow(int x,int n){
	int a=1;
	for(;n;n>>=1,x=(lint)x*x%O){
		if(n&1){
			a=(lint)a*x%O;
		}
	}
	return a;
}
int to[N];
int bitcnt[SN];
int f[SN];
inline int Main(){
	int n=ni,m=ni;
	for(int i=1;i<=m;i++){
		int u=ni,v=ni;
		to[u]|=1<<(v-1);
	}
	bitcnt[0]=0;
	for(int s=1,ts=1<<n;s<ts;s++){
		bitcnt[s]=bitcnt[s^(s&-s)]+1;
	}
	memset(f,0,sizeof(f));
	for(int s=0,ts=1<<n;s<ts;s++){
		if((s&1)!=((s>>1)&1))continue;
		lint ans=1;
		for(int t=s;t=s&(t-1),t;){
			if((t&1)!=((t>>1)&1))continue;
			lint tmp=1;
			for(int i=1;i<=n;i++){
				if((s>>(i-1))&1){
					if((t>>(i-1))&1){
						tmp*=(1<<bitcnt[to[i]&(((t>>(i-1))&1)?s^t:t)])-1;
					}else{
						tmp*=(1<<bitcnt[to[i]&t]);
					}
				}
			}
			ans+=tmp%O*f[t]%O;
		}
		f[s]=ans%O;
	}
	return (fpow(2,m)-f[(1<<n)-1]+O)%O;
}
int main(){
	printf("%d\n",Main());
	return 0;
}