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

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
}*/

int n, m;
int a[1000];
vi g[1000];

signed main()
{
  cin >> n >> m;
  rep(i, 0, n) cin >> a[i];
  rep(i, 0, m){
    int u, v;
    cin >> u >> v;
    u--; v--;
    g[u].pb(v);
    g[v].pb(u);
  }

  rep(v, 0, n){
    set<int> lo, hi;
    for(int e : g[v]){
      if(a[v] > a[e]) lo.insert(a[e]);
      if(a[v] < a[e]) hi.insert(a[e]);
    }
//    cout << v << " : " << lo << " , " << hi << endl;
    if(lo.size() >= 2 or hi.size() >= 2){
      cout << "YES" << endl;
      return 0;
    }
  }

  cout << "NO" << endl;

  return 0;
}