#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する
vector<pair<int,int> > e;
vector<int> a;

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

    int N,M;
    cin >> N >> M;

    rep(i,0,N){
        int tmp;
        cin >> tmp;
        a.push_back(tmp);
    }

    rep(i,0,M){
        int from,to;
        cin >> from >> to;
        from--;
        to--;
        e.emplace_back(from,to);
    }

    rep(i,0,M){
        rep(j,1,M){
            int A = e[i].first;
            int B = e[i].second;
            int C = e[j].first;
            int D = e[j].second;

            if(A == C){
                int v1 = a[B];
                int v2 = a[A];
                int v3 = a[D];
                if(v1 != v3){
                    if( (v1 < v2 && v3 < v2) || (v1 > v2 && v3 > v2)){
                        cout << "YES" << endl;
                        return 0;
                    }
                }
            }
            if(A == D){
                int v1 = a[B];
                int v2 = a[A];
                int v3 = a[C];
                if(v1 != v3){
                    if( (v1 < v2 && v3 < v2) || (v1 > v2 && v3 > v2)){
                        cout << "YES" << endl;
                        return 0;
                    }
                }
            }
            if(B == C){
                int v1 = a[A];
                int v2 = a[B];
                int v3 = a[D];
                if(v1 != v3){
                    if( (v1 < v2 && v3 < v2) || (v1 > v2 && v3 > v2)){
                        cout << "YES" << endl;
                        return 0;
                    }
                }
            }
            if(B == D){
                int v1 = a[A];
                int v2 = a[B];
                int v3 = a[C];
                if(v1 != v3){
                    if( (v1 < v2 && v3 < v2) || (v1 > v2 && v3 > v2)){
                        cout << "YES" << endl;
                        return 0;
                    }
                }
            }


        }
    }

    cout << "NO" << endl;
    return 0;
}