#include <bits/stdc++.h>
typedef long long LL;
typedef std::pair<int, int> pii;
typedef std::pair<LL, LL> pll;
typedef std::pair<LL, int> pli;
#define e_b emplace_back
#define MP std::make_pair
#define fi first
#define se second
int read()
{
    LL s = 0; int f = 1;
    char c = getchar();
    while (!(c >= '0' && c <= '9'))
        f ^= (c == '-'), c = getchar();
    while (c >= '0' && c <= '9')
        s = s * 10 + (c ^ 48), c = getchar();
    return f ? s : -s;
}
const int MAXN = 200005, inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3fll;
const int MOD = 1e9 + 7;
auto fplus = [](int x, int y){ return x + y >= MOD ? x + y - MOD : x + y; };
auto fminus = [](int x, int y){ return x >= y ? x - y : x + MOD - y; };
auto Fplus = [](int &x, int y){ return x = fplus(x, y); };
auto Fminus = [](int &x, int y){ return x = fminus(x, y); };
int fpow(int x, int y)
{
    int res = 1;
    for (; y; y >>= 1, x = (LL)x * x % MOD)
        if (y & 1) res = (LL)res * x % MOD;
    return res;
}
template<typename T> 
T& Fmin(T &x, T y){ return x = x < y ? x : y; };
template<typename T> 
T& Fmax(T &x, T y){ return x = x < y ? y : x; };
int n, m, e[1 << 15][15], f[1 << 15], dp[1 << 15], cnt[1 << 15];
int pw[1000];
int main()
{
    n = read(), m = read();
    pw[0] = 1;
    for (int i = 1; i <= m; i++)    
    {
        pw[i] = fplus(pw[i - 1], pw[i - 1]);
        int u = read() - 1, v = read() - 1;
        e[1 << u][v]++;
    }
    for (int s = 1; s < (1 << n); s++)
    {
        int j = s & -s;
        if (j != s) for (int i = 0; i < n; i++) e[s][i] = e[s ^ j][i] + e[j][i];
    }
    for (int s = 1; s < (1 << n); s++)
    {
        for (int t = (s - 1) & s; ; t = (t - 1) & s)
        {
            int tt = s ^ t;
            int j = std::__lg(tt & -tt);
            cnt[tt] = cnt[tt ^ (1 << j)] + e[s][j];
            if (t & (s & -s)) Fminus(f[s], (LL)dp[t] * f[tt] % MOD);
            if (!t) break;
        }
        dp[s] = pw[cnt[s]];
        for (int t = s; t; t = (t - 1) & s)
            Fminus(dp[s], (LL)f[t] * pw[cnt[s] - cnt[t]] % MOD);
        Fplus(f[s], dp[s]);
    }
    printf("%d\n", dp[(1 << n) - 1]);
    return 0;
}