#include<bits/stdc++.h>
#define reg register
// #define int long long
inline int read(){
    reg int x=0,k=1; reg char ch=getchar();
    while (ch<'0'||ch>'9') (ch=='-')&&(k=-1),ch=getchar();
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*k;
}
inline bool cmin(reg int &x,reg int y){return x>y?x=y,1:0;}
const int N=405,mod=1e9+7;
int n,m,fa[N],vis[N],is[N],efa[N];
struct E{int u,v;}e[N];
std::vector<std::pair<int,int>> G[N];
std::bitset<405> b[N];
void dfs(reg int u){
    vis[u]=1;
    for (auto [v,w]:G[u]) if (!is[w])
        if (!vis[v]) efa[v]=w,fa[v]=u,dfs(v),is[w]=1;
}
signed main(){
    n=read(),m=read();
    for (reg int i=1,u,v;i<=m;i++){
        u=read(),v=read();
        e[i]={u,v},G[u].push_back({v,i});
    }
    reg int ans=0,Ans=1;
    for (reg int rt=1;rt<=n;rt++){
        memset(vis,0,n+1<<2);
        dfs(rt);
        for (reg int i=1;i<=m;i++) if (!is[i]&&vis[e[i].u]&&vis[e[i].v]){
            reg int u=e[i].u,v=e[i].v;
            std::bitset<405> now; now[i]=1;
            while (efa[u]) now[efa[u]]=1,u=fa[u];
            while (efa[v]) now[efa[v]]=1,v=fa[v];
            reg int flg=0;
            for (reg int j=1;j<=m;j++)if (now[j]){
                if (!b[j].count()){b[j]=now,flg=1;break;}
                else now^=b[j];
            }
            ans+=flg;
        }
    }
    ans=m-ans;
    while (ans--) Ans=(Ans+Ans)%mod;
    printf("%d\n",Ans);
    return 0;
}