#include <bits/stdc++.h>

using namespace std;

const int N = 15, Z = (1 << N), M = N * (N - 1), MOD = 1e9 + 7;
inline int Plus(int a, int b) {return a + b >= MOD ? a + b - MOD : a + b; }
inline int Minus(int a, int b) {return a - b < 0 ? a - b + MOD : a - b; }
int n, m, G[N], f[Z], g[2][Z];
inline int ways(int s, int t) {
	int r = 0;
	for(int i = 0; i < n; i ++) 
		if(s >> i & 1) r = Plus(r, __builtin_popcount(G[i] & t));
	return r;
}
inline long long ksm(long long a, int b) {
	long long r = 1;
	while(b) {
		if(b & 1) r = r * a % MOD;
		b >>= 1, a = a * a % MOD;
	}
	return r;
}

int main() {
	ios::sync_with_stdio(false), cin.tie(0);

	cin >> n >> m;
	for(int i = 1; i <= m; i ++) {
		int a, b; cin >> a >> b; a --, b --;
		G[a] |= (1 << b);
	}
	const int MASK = (1 << n) - 1;
	g[0][0] = 1;
	for(int mask = 1; mask <= MASK; mask ++) {
		f[mask] = ksm(2, ways(mask, mask));
		for(int st = (mask - 1) & mask; st; st = (st - 1) & mask) {
			f[mask] = Minus(f[mask], Minus(g[1][st], g[0][st]) * ksm(2, Plus(ways(mask - st, mask - st), ways(mask - st, st))) % MOD);
			if(!(st & (mask & -mask))) continue;
			g[0][mask] = Plus(g[0][mask], 1ll * f[st] * g[1][mask - st] % MOD);
			g[1][mask] = Plus(g[1][mask], 1ll * f[st] * g[0][mask - st] % MOD);
		}
		f[mask] = Minus(f[mask], Minus(g[1][mask], g[0][mask]));
		g[1][mask] = Plus(g[1][mask], f[mask]);
	}
	cout << f[MASK] << '\n';

	return 0;
}