#include <bits/stdc++.h>
#define int long long
#define N 16

using namespace std;

const int M = (1 << N) + 10;
const int mod = 1e9 + 7;

int n, m, cnt[M], in[M], out[M], pw[M], cost[M];
int f[M], g[M], h[M];

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

signed main() {
	ios :: sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n >> m;
	
	for(int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		u = (1 << (u - 1));
		v = (1 << (v - 1));
		
		in[v] |= u;
		out[u] |= v;
	}
	
	pw[0] = 1;
	for(int i = 1; i <= 2 * m; i++) {
		pw[i] = pw[i - 1] * 2 % mod;
	}
	
	for(int S = 1; S < (1 << n); S++) {
		cnt[S] = 1 + cnt[S ^ lowbit(S)];
	}	
	
	for(int S = 1; S < (1 << n); S++) {
		//为了防止算重，钦定一个必选的
		int v = lowbit(S), _S = S ^ v;
		for(int T = _S; T; T = (T - 1) & _S) {
			g[S] = (g[S] - f[S ^ T] * g[T] % mod + mod) % mod;
		}
		h[S] = h[_S] + cnt[in[v] & _S] + cnt[out[v] & _S];
		
		f[S] = pw[h[S]];
		for(int T = S; T; T = (T - 1) & S) {
			int _T = S ^ T;
			int v = lowbit(_T);
			if(T == S)
				cost[T] = 0;
			else
				cost[T] = cost[T ^ v] - cnt[out[v] & _T] + cnt[in[v] & T];
			f[S] = (f[S] - g[T] * pw[h[_T] + cost[T]] % mod + mod) % mod;
		}
		g[S] = (g[S] + f[S]) % mod;
	}
	
	cout << f[(1 << n) - 1] << endl;
}