#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
// typedef __int128 ll;
typedef double ld;
const int mod = 1e9 + 7;
const int MAXN = 18;

ll pmod(ll v, ll p = mod) {
    v %= p;
    if (v < 0) {
        v += p;
    }
    return v;
}

ll power(ll a, ll b, ll p = mod) {
    ll c = 1;
    for (; b; b >>= 1) {
        if (b & 1) {
            c = pmod(c * a, p);
        }
        a = pmod(a * a, p);
    }
    return c;
}

ll inv(ll a) { return power(a, mod - 2); }

int e1[MAXN][1 << MAXN]; // e1[i][s] = i -> s
int e4[MAXN][1 << MAXN]; // e4[i][s] = s -> i
int e2[1 << MAXN];       // e2[s] = s -> s
int e3[1 << MAXN];       // e3[t] = s\t -> t
int G[MAXN][MAXN];
int popc[1 << MAXN];
ll f[1 << MAXN], g[1 << MAXN];
ll bas2[MAXN * MAXN * 2];
int root2[1 << MAXN];

void solve(int cas) {
    int n, m;
    cin >> n >> m;
    popc[0] = 0;
    for (int i = 1; i < (1 << n); i++) {
        popc[i] = popc[i ^ (i & (-i))] + 1;
    }
    for (int i = 0; i < n; i++) {
        root2[1 << i] = i;
    }
    memset(G, 0, sizeof(G));
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        G[u][v] = 1;
    }
    memset(e1, 0, sizeof(e1));
    for (int i = 0; i < n; i++) {
        int s = 0;
        for (int j = 0; j < n; j++) {
            if (G[i][j]) {
                s |= (1 << j);
            }
        }
        for (int t = 0; t < (1 << n); t++) {
            e1[i][t] = popc[t & s];
        }
    }
    memset(e4, 0, sizeof(e4));
    for (int i = 0; i < n; i++) {
        e4[i][0] = 0;
        for (int s = 1; s < (1 << n); s++) {
            e4[i][s] = e4[i][s ^ (s & (-s))] + G[root2[s & (-s)]][i];
        }
    }
    memset(e2, 0, sizeof(e2));
    for (int i = 0; i < (1 << n); i++) {
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                e2[i] += e1[j][i];
            }
        }
    }
    bas2[0] = 1;
    for (int i = 1; i <= m * 2; i++) {
        bas2[i] = pmod(bas2[i - 1] * 2);
    }
    vector<int> states;
    states.reserve(1 << n);
    for (int s = 1; s < (1 << n); s++) {
        if (popc[s] == 1) {
            f[s] = g[s] = 1;
            continue;
        }
        states.clear();
        for (int t = s; t > 0; t = (t - 1) & s) {
            states.push_back(t);
        }
        int len = states.size();
        e3[0] = 0;
        for (int i = len - 1; i >= 0; i--) {
            int t = states[i];
            int lb = t & (-t);
            e3[t] = e3[t ^ lb] - e1[root2[lb]][t ^ lb] + e4[root2[lb]][s ^ t];
        }
        g[s] = 0;
        int ux = s & (-s);
        for (int t = (s - 1) & s; t > 0; t = (t - 1) & s) {
            if (t & ux) {
                g[s] -= pmod(g[s ^ t] * f[t]);
            }
        }
        g[s] = pmod(g[s]);
        f[s] = 0;
        for (int t = s; t > 0; t = (t - 1) & s) {
            f[s] += pmod(bas2[e2[s ^ t] + e3[t]] * g[t]);
        }
        f[s] = pmod(bas2[e2[s]] - f[s]);
        g[s] = pmod(g[s] + f[s]);
    }
    cout << f[(1 << n) - 1] << endl;
}

int main() {
    ios::sync_with_stdio(false);
    // freopen("hidden.in", "r", stdin);
    // freopen("hidden.out", "w", stdout);
    int T = 1, cas = 0;
    // cin >> T;
    while (T--) {
        solve(++cas);
    }
    return 0;
}