//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
bool assign_min(T& a, T b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
T square(T a) {
	return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
	ll operator() (pair<ll, ll> p) const {
		return ((__int128)p.first * MOD + p.second) % INF64;
	}
};

void dfs(ll v, vector<vector<ll>>& g, vector<ll>& to) {
	to.push_back(v);
	for (auto i : g[v]) {
		dfs(i, g, to);
	}
}

struct DSU {
	vector<ll> p;
	DSU(ll n) {
		p.resize(n);
		for (ll i = 0; i < n; i++) {
			p[i] = i;
		}
	}
	ll get(ll v) {
		return (p[v] == v ? v : p[v] = get(p[v]));
	}
	void unite(ll a, ll b) {
		a = get(a);
		b = get(b);
		p[a] = b;
	}
};

void solve() {
	ll n, m;
	cin >> n >> m;
	vector<vector<ll>> g(n);
	DSU d(n);
	for (ll i = 0; i < m; i++) {
		ll a, b;
		cin >> a >> b;
		a--;
		b--;
		d.unite(a, b);
		g[a].push_back(b);
	}
	vector<vector<ll>> to(n);
	for (ll i = 0; i < n; i++) {
		dfs(i, g, to[i]);
		sort(to[i].begin(), to[i].end());
	}
	ll p2 = n;
	vector<bool> used(n, false);
	for (ll i = 0; i < n; i++) {
		if (d.get(i) == i) {
			for (auto j : to[i]) {
				used[j] = true;
			}
			p2--;
		}
	}
	vector<vector<bool>> g2(n, vector<bool>(n, false));
	for (ll i = 0; i < n; i++) {
		for (ll j = 0; j < n; j++) {
			vector<ll> na(to[i].size() + to[j].size());
			merge(to[i].begin(), to[i].end(), to[j].begin(), to[j].end(), na.begin());
			for (ll k = 1; k < na.size(); k++) {
				if (to[k] == to[k - 1]) {
					g2[i][j] = true;
				}
			}
		}
	}
	for (ll i = 0; i < n; i++) {
		if (used[i]) {
			continue;
		}
		DSU d(n);
		for (auto j : g[i]) {
			for (auto k : g[i]) {
				if (g2[j][k]) {
					d.unite(j, k);
				}
			}
		}
		for (auto j : g[i]) {
			if (d.get(j) == j) {
				p2++;
			}
		}
		p2--;
	}
	ll ans = 1;
	for (ll i = 0; i < p2; i++) {
		ans *= 2;
		ans %= MOD;
	}
	cout << ans << '\n';
}

int main() {
	if (IS_FILE) {
		freopen("", "r", stdin);
		freopen("", "w", stdout);
	}
    	ios_base::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
	ll t = 1;
	if (IS_TEST_CASES) {
		cin >> t;
	}
	for (ll i = 0; i < t; i++) {
		solve();
	}
}