#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pr pair<int, int>
#define pb push_back
#define mid (l + r) / 2
#define ls num << 1
#define rs num << 1 | 1

inline int read() {
    int x = 0, m = 1;
    char ch = getchar();

    while (!isdigit(ch)) {
        if (ch == '-') m = -1;
        ch = getchar();
    }

    while (isdigit(ch)) {
        x = x * 10 + ch - 48;
        ch = getchar();
    }

    return x * m;
}

inline void write(int x) {
    if (x < 0) {
        putchar('-');
        write(-x);
        return;
    }

    if (x >= 10) write(x / 10);
    putchar(x % 10 + '0');
}

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

int add(int x, int y) {
    return (x + y >= mod) ? (x + y - mod) : (x + y);
}

int sub(int x, int y) {
    return (x - y < 0) ? (x - y + mod) : (x - y);
}

void Add(int &x, int y) {
    x += y;
    if (x >= mod) x -= mod;
}

void Sub(int &x, int y) {
    x -= y;
    if (x < 0) x += mod;
}

int d[N], f[M], g[M], Pow[N * N * 2], pop[M], h[M];

signed main() {
    int n = read(), m = read();
    for (int i = 1; i <= m; i++) {
        int x = read() - 1, y = read() - 1;
        d[x] |= (1 << y);
    }
    Pow[0] = 1;
    for (int i = 1; i <= 2 * n * n; i++) Pow[i] = Pow[i - 1] * 2 % mod;
    f[0] = 1;
    for (int i = 0; i < (1 << n); i++) pop[i] = __builtin_popcount(i);
    g[0] = sub(0, 1);
    f[0] = h[0] = 1;
    for (int i = 1; i < (1 << n); i++) {
        int D = 0;
        for (int j = 0; j < n; j++) {
            if ((i >> j) & 1) D += pop[d[j] & i];
        }
        f[i] = Pow[D];
        for (int j = i; j; j = (j - 1) & i) {
            int x = i ^ j;
            D = 0;
            for (int y = 0; y < n; y++) if ((j >> y) & 1) D += pop[d[y] & x];
            Add(h[i], g[j] * Pow[D] % mod * h[x] % mod);
        }
        Sub(f[i], h[i]);
        Add(h[i], f[i]);
        int S = ((1 << n) - 1) ^ i;
        for (int j = S; ; j = (j - 1) & S) {
            Add(g[j ^ i], g[j] * sub(0, f[i]) % mod);
            if (!j) break;
        }
    }
    write(f[(1 << n) - 1]);
    putchar('\n');
}