#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b)	for (int i(a); i <= (b); ++i)

#define dec(i, a, b)	for (int i(a); i >= (b); --i)

typedef long long LL;

const LL mod = 1e9 + 7;

const int N = 105;

int n, m, s, cnt;

int mp[N][N], a[N][N], b[N], col[N], pre[N];

LL c[N][N], f[1 << 22], ans;

vector <int> v[N];

void init(){

	c[0][0] = 1;

	rep(i, 1, N - 2){

		c[i][0] = 1;

		rep(j, 1, i - 1){

			c[i][j] = c[i - 1][j - 1] + c[i - 1][j];

			c[i][j] %= mod;

		}

		c[i][i] = 1;

	}

}

void dfs(int x){

	col[x] = cnt;

	for (auto u : v[x]){

		if (col[u]) continue;

		dfs(u);

	}

}

int main(){

	init();

	while (~scanf("%d%d", &n, &m)){

		rep(i, 0, n + 1) v[i].clear();

		memset(mp, 0, sizeof mp);

		memset(col, 0, sizeof col);

		rep(i, 1, m){

			int x, y;

			scanf("%d%d", &x, &y);

			v[x].push_back(y);

			v[y].push_back(x);

			mp[x][y] = 1;

			mp[y][x] = -1;

		}

		cnt = 0;

		rep(i, 1, n) if (!col[i]) ++cnt, dfs(i);

		memset(b, 0, sizeof b);

		rep(i, 1, n) a[col[i]][b[col[i]]++] = i;

		s = n;

		ans = 1;

		rep(i, 1, cnt){

			int maxS = (1 << b[i]) - 1;

			rep(j, 0, maxS + 2) f[j] = 0;

			f[0] = 1LL;

			memset(pre, 0, sizeof pre);

			rep(j, 0, b[i] - 1){

				rep(k, 0, b[i] - 1) if (j ^ k){

					if (mp[a[i][j]][a[i][k]] == 1) pre[k] |= (1 << j);

				}

			}

			rep(S, 0, maxS) if (f[S] > 0){

				rep(j, 0, b[i] - 1){

					if (((S & pre[j]) == pre[j]) && !(S & (1 << j))){

						f[S | (1 << j)] += f[S];

						f[S | (1 << j)] %= mod;

					}

				}

			}

			ans = ans * f[(1 << b[i]) - 1] % mod * c[s][b[i]] % mod;

			s -= b[i];

		}

		printf("%lld\n", ans);

	}

	return 0;

}