#include <bits/stdc++.h>
using namespace std;

#define rep(i, j, n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcm(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, m;
  cin >> n >> m;
  vt<int> a(n);
  rep(i, 0, n) cin >> a[i];
  vt<set<int>> edge(n);
  rep(i, 0, m) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    edge[u].insert(v);
    edge[v].insert(u);
  }

  rep(i, 0, n) {
    rep(j, i + 1, n) {
      for(auto nxt : edge[i]) {
        if(nxt == j || !edge[j].count(nxt)) continue;

        if(a[nxt] > a[i] && a[nxt] > a[j] && a[i] != a[j]) return cout << "YES\n", 0;
      }
    }
  }
  cout << "NO\n";
}