#include<bits/stdc++.h>

#define rep(i, a, b) for(int i = (a); i <= (b); ++i)

using namespace std;

const int N = 15, P = 1e9 + 7; 

inline void inc(int &x, int y) { x += y - P; x += (x >> 31) & P; }
inline void dec(int &x, int y) { x -= y; x += (x >> 31) & P; }

int n, m, all, f[1 << N], g[1 << N], cnt[1 << N], pw[N * N], to[N];

signed main() {
	cin >> n >> m; all = (1 << n) - 1;
	pw[0] = 1; rep(i, 1, n * n) pw[i] = 2ll * pw[i - 1] % P;
	
	for(int i = 1, u, v; i <= m; i++) {
                cin >> u >> v; --u; --v;
		to[u] |= 1 << v; 
	}
	
	g[0] = 1;
	rep(s, 1, all) {
		rep(i, 0, n - 1) if((s >> i) & 1) 
			cnt[s] += __builtin_popcount(to[i] & s);
		f[s] = pw[cnt[s]]; int x = s & -s;
		for(int t = (s - 1) & s; t; t = (t - 1) & s) if(t & x)
			dec(g[s], 1ll * f[t] * g[s ^ t] % P);
		for(int t = s, e = 0; t; t = (t - 1) & s, e = 0) {
			rep(i, 0, n - 1) if((t >> i) & 1) 
				e += __builtin_popcount(to[i] & (s ^ t));
			dec(f[s], 1ll * g[t] * pw[cnt[s ^ t] + e] % P);
		}
		inc(g[s], f[s]);
	}
	
	cout << f[all] << endl;
	return 0;
}