#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define make_unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 Rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = 1e3 + 200;
const int M = 1e6;
const int inf = 2e9 + 3;
const ll INF = 1e18;

int n, m;
int c[N][N];
vector<int> g[N];
const int mod = 1e9 + 7;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 1, v, u; i <= m; ++i) {
        cin >> v >> u;
        g[u].push_back(v);
    }
    for (int i = 1; i <= n; ++i) {
        sort(all(g[i]));
        reverse(all(g[i]));
    }
    for (int i = 1; i <= n; ++i) {
        c[i][i] = 1;
        for (auto j : g[i]) {
            for (int k = 1; k <= j; ++k) {
                if (c[k][j] && c[k][i]) {
                    m--;
                    break;
                }
            }
            for (int k = 1; k <= j; ++k) {
                if (c[k][j]) c[k][i] = 1;
            }
        }
    }
    int ans = 1;
    for (int i = 1; i <= m; ++i) ans = (ans * 2) % mod;
    cout << ans << '\n';
    
}