#include using namespace std; struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star; #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() #define vv(type, c, m, n, i) vector> c(m, vector(n, i)) #define mat(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define each(x,y) for(auto &(x):(y)) #define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { cin >> t; } templatevoid Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); } #define vec(type, c, n) vector c(n);for(auto& i:c) cin>>i; #define len(x) ((int)(x).size()) #define mp make_pair #define eb emplace_back #define em emplace #define pb pop_back #define fi first #define se second #define get(a, i) get(a) #define mt make_tuple #define zero(a, b) setw(a)< vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; #define mini min_element #define maxi max_element #define sum accumulate #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << "\n";} template inline void print(H h, T... t){cout << h << " ";print(t...);} string solve() { var(int, n, m); vec(int, a, n); unordered_map> m_min; unordered_map> m_max; int u, v; rep(i, 0, m) { cin >> u >> v; --u, --v; if (a[u] == a[v]) continue; if (a[u] > a[v]) { m_min[u].em(a[v]); } else { m_max[u].em(a[v]); } if (a[v] > a[u]) { m_min[v].em(a[u]); } else { m_max[v].em(a[u]); } } rep(i, 0, n) { if (len(m_min[i]) >= 2 || len(m_max[i]) >= 2) { return "YES"; } } return "NO"; } int main() { print(solve()); return 0; }