#include <bits/stdc++.h>
#define for_(i,a,b) for (int i = (a); i < (b); i++)
#define rep_(i,a,b) for (int i = (a); i <= (b); i++)
#define per_(i,a,b) for (int i = (a); i >= (b); i--)
#define pii pair<int, int>
#define pll pair<ll, ll> 
#define fi first
#define se second
#define ll long long
#define sz(a) (int)a.size()
#define all(v) v.begin(), v.end()
#define clr(x) memset(x, 0, sizeof(x))
#define wls(v)   sort(all(v)); v.erase(unique(all(v)), v.end());
#define ull unsigned long long
#define pb push_back
#define D(x) cerr << #x << '=' << x << endl
#define outarr(a,L,R) cerr<<#a"["<<L<<".."<<R<<"]=";rep_(_x,(L),(R))cerr<<a[_x]<<" "; cerr<<endl; 
	#ifdef LOCAL
#define line cout << "--------------------------------" << endl;
#define CE cout << endl;
#define CO cout << "OK" << endl;
    #endif
#define endl '\n'
#define int ll
using namespace std;
bool be;clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}
const int maxn = 2e5 + 10, mod = 1e4 + 7;// mod = 1949777;
const double EPS = 1e-3;
template <typename Type>
void add(Type &x, Type y, Type Md = mod) {
	x += y; while(x >= Md) x -= Md;
	while(x < 0) x += Md;
}ll Get(int a, int b) {
	a %= mod;
	ll ans = 1; 
	while(b) {
		if (b & 1) ans = ans * a % mod;
		b >>= 1;
		a = 1ll * a * a % mod;
	}
	return ans;
}
int n, m;
bool ed;
int d[500][500], a[505][505];
signed main() {
	#ifdef LOCAL
		freopen("w.in", "r", stdin);
//		freopen("w.out", "w", stdout);
		startTime = clock();
//		time_t now_time = time(NULL); tm* TuT = localtime(&now_time); cout << asctime(TuT); cout << "CodeBegin:_______________________" << endl;
//		cout << "Memory footprint:" << ((&be - &ed) >> 20) <<"MB"<< endl;
//		line;
	#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
  //int tt; cin >> tt; while(tt--) solve();
  cin >> n >> m;
  int u, v;
  rep_(i, 1, m ) {
  	cin >> u >> v;
  	d[u][u]++;
	d[v][u]--;
  }
  rep_(i, 2, n) rep_(j, 2, n) a[i - 1][j - 1] = d[i][j];
  n--;
  int sgn = 1;
 	rep_(i, 1, n){
		int k = i;
		while(!a[k][i] && k <= n) k++;
		if (k != i) {
			swap(a[k], a[i]);
			sgn *= -1;
		}
		int inv = Get(a[i][i], mod - 2);
		rep_(j, i + 1, n) {
			int d = 1ll * a[j][i] * inv % mod;
			rep_(g, i, n) {
				a[j][g] = (a[j][g] - 1ll * d * a[i][g] % mod + mod) % mod;
			} 
		}
	}
	ll ans = 1;
	rep_(i, 1, n) ans = ans * a[i][i] % mod;
	ans *= sgn;
	ans = (ans % mod + mod) % mod;
	cout << ans << endl;
  	#ifdef LOCAL
  	cerr<<"\n\n-----------------------\nProgram done in "<<clock()-startTime<<" ms";
	#endif
 	return 0; 
}
//by whc
// check if over int , and open long long !!!