#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int A[1100];
set<int> g[1100], l[1100];

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

    int N, M;
    std::cin >> N >> M;

    for(int i=1;i<=N;++i){
        std::cin >> A[i];
    }

    for(int i=0;i<M;++i){
        int u, v;
        std::cin >> u >> v;

        if(A[u] > A[v]){
            l[u].emplace(A[v]);
            g[v].emplace(A[u]);
        }else if(A[u] < A[v]){
            g[u].emplace(A[v]);
            l[v].emplace(A[u]);
        }
    }

    for(int i=1;i<=N;++i){
        if(l[i].size() >= 2 || g[i].size() >= 2){
            std::cout << "YES" << std::endl;
            return 0;
        }
    }

    std::cout << "NO" << std::endl;
}