#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
using namespace std;
namespace Main {
#define ctz __builtin_ctz
#define int long long
#define endl '\n'
#define lson i<<1
#define rson i<<1|1
#define debug(x) cerr << #x << " = " <<  x << "\n";
#define debug2(l,r) cerr << "[" #l "," #r "] = [" << l << "," << r << "]\n";
#define debug3(x,y,z) cerr << "{" #x "," #y "," #z "} = " << "{" << x << "," << y << "," << z << "}\n";
#define debugv(v) cerr << #v": size= " << v.size() << "\nelement: " ; for(auto p:v)  cerr << p << " ";
const int N = 1 << 15, M = 15, MOD = 1e9 + 7;
int n, m, dp[N], f[N], c[M][M], g[N][M], h[N], bs[N];
void dec(int &x, int y) {
    (x -= y) < 0 ? x += MOD : 0;
}
void inc(int &x, int y) {
    (x += y) >= MOD ? x -= MOD : 0;
}
int lowbit(int x) {
    return x & (-x);
}
signed main() {
	cin.tie(0), ios_base::sync_with_stdio(false);
	cin >> n >> m;
	for (int i = 1, x, y; i <= m; i++) {
        cin >> x >> y;
        x--, y--;
        c[x][y] = 1;
	}
	for (int i = 0; i < (1 << n); i++)
        for (int j = 0; j < n; j++)
            for (int k = 0; k < n; k++)
                if ((i >> k) & 1 && c[k][j]) g[i][j]++;
    bs[0] = 1;
    for (int i = 1; i <= m; i++)
        bs[i] = bs[i - 1] * 2 % MOD;
    for (int i = 0; i < (1 << n); i++) {
        for (int j = i & (i - 1); j; j = i & (j - 1))
            if (j & lowbit(i)) dec(f[i], f[i ^ j] * dp[j] % MOD);
        for (int j = i & (i - 1); j; j = i & (j - 1))
            h[j] = h[j | lowbit(i ^ j)] + g[i][ctz(i ^ j)];
        h[0] = h[lowbit(i)] + g[i][ctz(i)];
        for (int j = i; j; j = i & (j - 1))
            dec(dp[i], f[j] * bs[h[j]] % MOD);
        inc(dp[i], bs[h[0]]);
        inc(f[i], dp[i]);
    }
    cout << dp[(1 << n) - 1] << endl;
	return 0;
}
}
signed main() {
    Main::main();
    return 0;
}