// includes #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define vrep(v, i) for(int i = 0; i < (v).size(); i++) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define FI first #define SE second #define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n]; #define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m]; #define bit(n) (1LL<<(n)) #define INT(n) int n; cin >> n; #define LL(n) ll n; cin >> n; #define DOUBLE(n) double n; cin >> n; using namespace std; // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; typedef complex cd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // solve template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} template ostream &operator<<(ostream &os, const vector& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template ostream &operator<<(ostream &os, const set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const pair &p){os << p.first << " " << p.second; return os;} template ostream &operator<<(ostream &os, const map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template ostream &operator<<(ostream &os, const unordered_map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template T power(T a, T n, T mod) { T res = 1; T tmp = n; T curr = a; while(tmp){ if(tmp % 2 == 1){ res = (T)((ll)res * curr % mod); } curr = (T)((ll)curr * curr % mod); tmp >>= 1; } return res; } struct Factorial{ int n; const int MOD = 1e9 + 7; vector fac; vector inv_; Factorial(int n): n(n){ fac.resize(n + 1); inv_.resize(n + 1); calc_factorial(); calc_inv(); } void calc_factorial(){ fac[0] = 1; for(int i = 1; i <= n; i++){ fac[i] = i * fac[i-1] % MOD; } } void calc_inv(){ inv_[n] = power(fac[n], MOD - 2, MOD); for(int i = n - 1; i >= 0; i--){ inv_[i] = (i + 1) * inv_[i+1] % MOD; } } long long& operator[](size_t i){ if(i < 0 || i > n){ cerr << "list index out of range" << endl; abort(); } return fac[i]; } long long inv(size_t i){ if(i < 0 || i > n){ cerr << "list index out of range" << endl; abort(); } return inv_[i]; } long long comb(int n, int k){ if(n < k)return 0; long long res = fac[n]; res = res * inv_[n-k] % MOD; res = res * inv_[k] % MOD; return res; } long long perm(int n, int k){ if(n < k)return 0; long long res = fac[n]; res = res * inv_[n-k] % MOD; return res; } long long h(int n, int k){ if(n == 0 && k == 0)return 1; return comb(n + k - 1, k); } }; vector edge[201]; ll dp[1001][1001]; int W[201][201]; int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); INT(n); INT(m); vector w(n); cin >> w; rep(i, m){ INT(u); INT(v); u--, v--; edge[u].pb(v); } Factorial fac(1001); dp[0][0] = 1; FOR(i, 1, 1001){ FOR(j, 1, 1001){ dp[i][j] = (dp[i-1][j-1] + j * dp[i-1][j] % mod) % mod; } } FOR(i, 1, 1001){ FOR(j, 1, 1001){ dp[i][j] = dp[i][j] * fac[j] % mod; } } rep(i, n){ rep(j, n)W[i][j] = inf; } rep(i, n){ W[i][i] = w[i]; for(auto e: edge[i]){ W[i][e] = w[e]; } } for(int k = 0; k < n; k++){ for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ if(W[i][k] != inf && W[k][j] != inf){ if(W[i][j] == inf)W[i][j] = -1; W[i][j] = max(W[i][j], min(W[i][k], W[k][j])); if(W[i][j] == -1)W[i][j] = inf; } } } } // rep(i, n){ // rep(j, n)cout << W[i][j] << "\n "[j + 1 != n]; // } ll res = 0; rep(i, n){ rep(j, n){ if(W[i][j] != inf && W[i][j] >= w[j])res = (res + dp[w[i]][w[j]]) % mod; } } cout << res << endl; return 0; }