#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
const int N=1000;
const int M=1e6;
const int mo=1e9+7;
int n,m,d[N+10],f[M+10],bitcnt[M+10];
struct edges {
    int u,v;
}e[N+10];
int Sum(int x,int y) {
    x+=y;
    return (x>=mo)?x-mo:x;
}
int Mul(int x,int y) {
    return (long long)x*y%mo;
}
int main() {
    scanf("%d%d",&n,&m);
    for (int i=1;i<=m;i++) {
        int u,v;
        scanf("%d%d",&u,&v);
        d[u]|=(1<<(v-1));
    }
    for (int i=0;i<(1<<n);i++) {
        bitcnt[i]=0;
        for (int j=0;j<n;j++)
            if (i&(1<<j)) bitcnt[i]++;
    }
    f[0]=1;
    for (int i=0;i<(1<<n)-1;i++) {
        int nx=((1<<n)-1)^i;
        for (int j=nx;j>0;j=(j-1)&nx) {
            if ((j&1)&&(j&2)) continue;
            int va=1;
            for (int k=1;k<=n;k++)
                if (!(j&(1<<(k-1)))&&!(i&(1<<(k-1)))) {
                    int cnt=bitcnt[d[k]&j];
                    va=Mul(va,(1<<cnt)-1);
                }
                else if (j&(1<<(k-1))) {
                    int cnt=bitcnt[d[k]&(((1<<n)-1)^i^j)];
                    va=Mul(va,(1<<cnt));
                }
            f[i|j]=Sum(f[i|j],Mul(f[i],va));
        }
    }
    printf("%d\n",f[(1<<n)-1]);
    return 0;
}
