#include <bits/stdc++.h>

using namespace std;

constexpr int mod = 1e9 + 7;

constexpr int maxn = 405;

bitset<maxn> go[maxn];

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> g(n);
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        g[u].push_back(v);
    }
    for (int i = n - 1; i >= 0; --i) {
        for (auto j : g[i]) {
            go[i] |= go[j];
            go[i][j] = 1;
        }
    }
    int ans = 1;
    bitset<maxn> used;
    for (int i = 0; i < n; ++i) {
        if (used[i]) {
            continue;
        }
        bitset<maxn> add = go[i];
        for (int j = 0; j < n; ++j) {
            if (add[j] && used[j]) {
                add &= go[j].flip();
            }
        }
        for (int j = 0; j < n; ++j) {
            if (add[j]) {
                ans *= 2;
                if (ans >= mod) {
                    ans -= mod;
                }
            }
        }
        used[i] = 1;
        used |= add;
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}