#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,a) for(int i=0;i<(a);i++)
#define MOD 1000000007

int p[1000][1000];

int main(){
  int n,m; cin>>n>>m;
  int a[n];
  rep(i,n) cin>>a[i];
  rep(i,m){
    int x,y; cin>>x>>y;
    x--, y--;
    p[x][y]=p[y][x]=1;
  }
  for(int i=0;i<n-2;i++){
    for(int j=i+1;j<n-1;j++){
      for(int k=j+1;k<n;k++){
        if(a[i]==a[j]||a[i]==a[k]||a[j]==a[k]) continue;
        int ma=max({a[i],a[j],a[k]});
        int mi=min({a[i],a[j],a[k]});
        int v[3]={i,j,k};
        do{
          bool flag1=p[v[0]][v[1]]&&p[v[1]][v[2]];
          bool flag2=(a[v[1]]==ma)||(a[v[1]]==mi);
          if(flag1&&flag2){
            //cout<<v[0]<<" "<<v[1]<<" "<<v[2]<<endl;
            cout<<"YES"<<endl;
            return 0;
          }
        }while(next_permutation(v,v+3));
      }
    }
  }
  cout<<"NO"<<endl;
  return 0;
}