// author : HuuHung
// 25.3.2024


#include <bits/stdc++.h>
#define ii pair <int, int>
#define F first
#define S second
#define ll long long
#define lb long double
#define pb push_back
#define vi vector <int>
#define vll vector <ll>
#define Bit(x, i) ((x) >> (i) & 1)
#define Mask(i) (1ll << (i))
#define All(v) (v).begin(), (v).end()

using namespace std;

void maxzi(auto &a, auto b){
    a = max(a, b);
}

void minzi(auto &a, auto b){
    a = min(a, b);
}

const int N = 405;
const int mod = 1e9 + 7;
const int LG = 20;

void add(auto &a, auto b){
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

void mul(auto &a, auto b){
    a = 1ll * a * b % mod;
}

int Pow(int a, int b){
    if (b == 0) return 1;
    if (b % 2) return 1ll * a * Pow(a, b - 1) % mod;
    int c = Pow(a, b / 2);
    return 1ll * c * c % mod;
}

// * end

int n, m, b[N], vis[N];
vector <int> adj[N];
bitset <N> val[N];

struct basis{
    bitset <N> a[N];
    int cnt = 0;

    void ins(bitset <N> tmp){
        for (int i = 1; i <= n; ++ i){
            if (tmp[i]){
                if (!a[i][i]) {
                    ++ cnt;
                    a[i] = tmp;
                    return;
                }
                tmp ^= a[i];
            }
        }
    }
} bas;

void dfs(int u){
    vis[u] = 1;
    for (int i : adj[u]){
        int v = b[i];
        if (!vis[v]){
            val[v] = val[u];
            val[v].flip(i);
            dfs(v);
        }
        else {
            bitset <N> tmp = val[u] ^ val[v];
            tmp.flip(i);
            bas.ins(tmp);
        }
    }
}

void solve(){
    cin >> n >> m;
    for (int i = 1, a; i <= m; ++ i){
        cin >> a >> b[i];
        adj[a].pb(i);
    }

    for (int i = 1; i <= n; ++ i){
        val[i].reset();
        for (int j = 1; j <= n; ++ j) vis[j] = 0;
        dfs(i);
    }

    cout << Pow(2, m - bas.cnt);
}


int main(){
    //freopen("code.inp", "r", stdin);
    //freopen("code.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t --) solve();

    return 0;
}