// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 15, MAXS = (1 << MAXN) + 5;
const int MOD = 1e9 + 7;

int N, M;
int G[MAXN], Gr[MAXN];

void input()
{
    read(N); read(M);
    for (int i = 1; i <= M; ++i) {
        int u, v;
        read(u); read(v);
        --u; --v;
        G[u] |= 1 << v;
        Gr[v] |= 1 << u;
    }
}

void solve()
{
    static int pow2[MAXN * MAXN + 5];

    pow2[0] = 1;
    for (int i = 1; i <= M; ++i) {
        pow2[i] = pow2[i - 1] * 2ll % MOD;
    }

    static int dp[MAXS];
    int sbnd = 1 << N;

    dp[0] = 1;
    for (int s = 0; s < sbnd; ++s) {
        if (!dp[s])
            continue;
        int sr = (sbnd - 1) ^ s;
        for (int s0 = sr; s0; s0 = (s0 - 1) & sr) {
            if ((s0 & 1) ^ (s0 >> 1 & 1))
                continue;
            LL t = dp[s];
            for (int i = 0; i < N; ++i) {
                if (s >> i & 1)
                    (t *= pow2[__builtin_popcount(G[i] & s0)]) %= MOD;
                else if (!(s0 >> i & 1))
                    (t *= pow2[__builtin_popcount(G[i] & s0)] - 1 + MOD) %= MOD;
            }
            (dp[s | s0] += t) %= MOD;
        }
    }
    int ans = (pow2[M] - dp[sbnd - 1] + MOD) % MOD;

    printf("%d\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 白云依静渚，春草闭闲门。
//     -- 刘长卿《寻南溪常山道人隐居 / 寻南溪常道士》


Measured memory_bytes: 384