#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

vector<int> G[1001];
ll v[1005];
bool visited[1001];
ll kadomatu[3];

string to_string(ll x) {
	stringstream ss;
	ss << x;

	return ss.str();
}

int cti(char a) {

	return a - '0';
}

bool judge = false;

void dfs(int n, int s) {

	if (n == 2) {
		kadomatu[2] =v[s];

		if (kadomatu[0]<kadomatu[1] && kadomatu[1]>kadomatu[2] && kadomatu[0] != kadomatu[2] || kadomatu[0]>kadomatu[1] && kadomatu[1]<kadomatu[2] && kadomatu[0] != kadomatu[2])  {
			/*cout<<kadomatu[0]<<" "<<kadomatu[1]<<" "<<kadomatu[2]<<endl;*/
			/*cout << ans << endl;*/
			judge = true;

		}
		return;
	}

	for (int i = 0; i < G[s].size(); i++) {
		int tmp = G[s][i];

		if (!visited[tmp]) {
			kadomatu[n+1] =v[tmp];
			dfs(n + 1, tmp);
		}
	}

}

int main() {

	int n = 0, m = 0;
	cin >> n >> m;

	int tmp;
	for (int i = 1; i <= n; i++) {
		cin >> tmp;
		v[i] = tmp;
	}

	int s, t;
	for (int i = 0; i < m; i++) {
		cin >> s >> t;

		G[s].push_back(t);
		G[t].push_back(s);
	}

	for (int i = 1; i <= n; i++) {
		visited[i] = true;
		kadomatu[0] = v[i];

		dfs(0, i);
		if (judge) {
			cout << "YES" << endl;
			return 0;
		}
		visited[i] = false;
	}
				cout << "NO" << endl;


	return 0;
}