#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
int D[1 << 17];
int P[1 << 17];
int s1[55],s2[55];
int W[1 << 17];
const int mod = 1e9 + 7;
int main(void)
{
    int n,m;
    cin>>n>>m;
    int p2 = 1;
    while (m --)
    {
        int a,b;
        cin>>a>>b;
        --a;--b;
        s1[a] |= 1 << b;
        s2[b] |= 1 << a;
        p2 = p2 * 2 % mod;
    }
    const int N = 1 << n;
    P[0] = 1;
    for (int mask = 1;mask < N;++mask)
        P[mask] = (P[mask - (mask & (-mask))] * 2) % mod;
    D[0] = 1;
    int ans = 0;
    for (int mask = 0;mask < N;++mask)
        if (D[mask])
        {
            const int rem = (N - 1) ^ mask;
            for (int sub = rem;sub;sub = (sub - 1) & rem)
            if ((sub&3) == 3 || !(sub&3))
            {
                const int R = rem ^ sub;
                int coef = D[mask];
                for (int j = 0;j < n;++j)
                    if ((R >> j) & 1)
                        coef = (1ll * coef * (P[s1[j] & sub] - 1)) % mod,coef = (1ll * coef * P[s2[j] & sub]) % mod;
                D[sub | mask] = (D[sub | mask] + coef) % mod;
            }
        }
    ans = (p2 + mod - D[N - 1]) % mod;
    cout << ans << '\n';
    return 0;
}
