#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

typedef long long i64;
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;

int answer = 1;
int N, M;
int edgeCnt[20][MAXN], dp[MAXN];

inline int loBit(int x)
{
	return x & (-x);
}

inline bool checkContain(int x)
{
	return !(((x & 0x03) != 0) && ((x & 0x03) != 0x03));
}

int main()
{
	cin >> N >> M ;

	for(int i = 1; i <= M; i++)
	{
		int u, v;
		cin >> u >> v, u--, v--;
		edgeCnt[u][1 << v] += 1;
		answer = (2LL * answer) % MOD;
	}

	for(int i = 0; i < N; i++)
		for(int j = 0; j < (1 << N); j++)
			edgeCnt[i][j] = edgeCnt[i][loBit(j)] + edgeCnt[i][j ^ loBit(j)];

	for(int i = 0; i < (1 << N); i++)
	{
		if(!checkContain(i))
			continue;
		dp[i] = 1;

		for(int j = ((i - 1) & i); j > 0; j = ((j - 1) & i))
		{
			if(!checkContain(j))
				continue;

			int tmp = i ^ j;
			i64 val = dp[tmp];

			for(int k = 0; k < N; k++)
			{
				if(tmp & (1 << k))
					val = 1LL * val * ((1 << edgeCnt[k][j]) - 1) % MOD;
				else if(j & (1 << k))
					val = 1LL * val * (1 << edgeCnt[k][tmp]) % MOD;
			}
			dp[i] = (1LL * dp[i] + val) % MOD;
		}
	}
	cout << (answer - dp[(1<<N) - 1] + MOD) % MOD << endl ;
	return 0;
}

