#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define SZ(v) ((int)v.size())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define POPCNT(n) (__builtin_popcount(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

class StronglyConnectedComponents {
    void dfs(int v) {
        if (used[v]) return;
        used[v] = true;
        for (auto &u : gg[v]) dfs(u);
        ord.push_back(v);
    }

    void rdfs(int v) {
        if (~cmp[v]) return;
        cmp[v] = sz;
        for (auto &u : rg[v]) rdfs(u);
    }

    // 強連結成分分解
    void build() {
        const int n = g.size();
        for (int i = 0; i < n; ++i) dfs(i);
        reverse(ord.begin(), ord.end());
        for (int i : ord) if (!~cmp[i]) rdfs(i), ++sz;
        dag.resize(sz);
        for (int i = 0; i < n; ++i) {
            for (int j : g[i]) {
                int x = cmp[i], y = cmp[j];
                if (x == y) continue;
                dag[x].emplace_back(y);
            }
        }
    }

public:
    using UnweightedGraph = vector<vector<int>>;

    int sz;
    const UnweightedGraph &g;
    UnweightedGraph gg, rg, dag;
    vector<int> cmp, ord;
    vector<bool> used;

    StronglyConnectedComponents(const UnweightedGraph &g) : sz(0), g(g), gg(g.size()), rg(g.size()), cmp(g.size(), -1), used(g.size(), false)
    {
        const int n = g.size();
        for (int i = 0; i < n; ++i) {
            for (int j : g[i]) {
                gg[i].emplace_back(j);
                rg[j].emplace_back(i);
            }
        }
        build();
    }

    // 要素kが属する成分の番号
    int operator[](int k) { return cmp[k]; }

    // xとyが同じ成分に含まれるか
    bool same(int x, int y) { return cmp[x] == cmp[y]; }

    // 成分の個数
    int size() { return sz; }
};
using SCC = StronglyConnectedComponents;

vector<vector<int>> reverse_digraph(const vector<vector<int>> &g) {
    const int n = g.size();
    vector<vector<int>> res(n);
    for (int v = 0; v < n; ++v) {
        for (int u : g[v]) {
            res[u].push_back(v);
        }
    }
    return res;
}

int dpW[1010], dpB[1010];
bool used[1010];

void dfs(int v, const vector<vector<int>> &g) {
    used[v] = true;
    int sum = 0;
    dpW[v] = 1;
    dpB[v] = 1;
    for (int u : g[v]) {
        dfs(u, g);
        (dpB[v] *= (dpW[u] + dpB[u]) % MOD) %= MOD;
    }
}

void _main() {
    int N, M;
    cin >> N >> M;
    vector<vector<int>> g(N);
    REP(i, M) {
        int S, D;
        cin >> S >> D;
        S--; D--;
        g[S].push_back(D);
    }
    SCC scc(g);
    vector<vector<int>> g2 = reverse_digraph(scc.dag);
    int ans = 1;
    for (int i = scc.size() - 1; i >= 0; --i) {
        if (!used[i]) {
            dfs(i, g2);
            (ans *= (dpW[i] + dpB[i]) % MOD) %= MOD;
        }
    }
    cout << ans << endl;
}

signed main(signed argc, char **argv) {
    if (argc > 1) {
        if (strchr(argv[1], 'i'))
            freopen("input.txt", "r", stdin);
        if (strchr(argv[1], 'o'))
            freopen("output.txt", "w", stdout);
    }
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}


Measured memory_bytes: 3424