#include <bits/stdc++.h>
#define AOTSUKI

using namespace std;
constexpr bool isMultiCase = 0;

// #include "angel/math/modint.hpp"

using ll = long long;
template <class T> constexpr int len(const T &c) {
    return int(std::ssize(c));
}
template <class T> using V = vector<T>;
template <class T> using RevPq = priority_queue<T, vector<T>, greater<T>>;
constexpr char eoln = '\n';
#define L(i, l, r) for (int i = (l); i < (r); ++i)
#define R(i, l, r) for (int i = (r) - 1; i >= (l); --i)
#define ALL(x) (x).begin(), (x).end()
#define fi first
#define se second

constexpr ll mod = 1000000007;

struct Dsu {
    int n, comps;
    V<int> data;

    Dsu(int n_) : n(n_), comps(n), data(n, -1) {}

    int find(int v) {
        if (data[v] >= 0) return data[v] = find(data[v]);
        else return v;
    }

    void unite(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return;
        --comps;
        if (data[a] > data[b]) swap(a, b);
        data[a] += data[b];
        data[b] = a;
    }
};

void solve() {
    int n, m; cin >> n >> m;
    V<V<int>> g(n);
    V<int> a(m), b(m);
    L(t, 0, m) {
        int u, v; cin >> u >> v; --u, --v;
        a[t] = u; b[t] = v;
        g[u].push_back(v);
    }

    V<V<bool>> reachable(n, V<bool>(n));
    L(f, 0, n) {
        queue<int> que;
        que.push(f);
        auto &used = reachable[f];
        used[f] = true;
        while (not que.empty()) {
            auto u = que.front(); que.pop();
            for (int t : g[u]) {
                if (used[t]) continue;
                used[t] = true;
                que.push(t);
            }
        }
    }

    Dsu uft(n);
    L(i, 0, m) {
        L(j, 0, m) {
            if (b[i] != b[j]) continue;
            L(f, 0, n) {
                if (reachable[f][a[i]] and reachable[f][a[j]]) {
                    uft.unite(i, j);
                }
            }
        }
    }
    int k = uft.comps;
    ll ans = 1;
    while (k--) {
        ans *= 2;
        if (ans >= mod) ans -= mod;
    }

    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    if (not isMultiCase) {
        solve();
    } else {
        int t;
        cin >> t;
        while (t--) solve();
    }
}