#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <cmath>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

bool C(int a, int b, int c) {
	bool flag = false;
	if (a != b && b != c && c != a) {
		if ((a > b && c > b) || (a < b && c < b)) flag = true;
	}

	if (flag) return true;
	else return false;
}

vector<vector<int>> V(1009);
int a[1009];

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

	int N, M; cin >> N >> M;
	for (int i = 1; i <= N; i++) cin >> a[i];
	for (int i = 0; i < M; i++) {
		int x, y; cin >> x >> y;
		V[x].push_back(y);
		V[y].push_back(x);
	}

	bool flag = false;

	for (int i = 1; i <= N && !flag; i++) {
		for (int j = 0; j < V[i].size(); j++) {
			for (int k = j + 1; k < V[i].size(); k++) {
				int fro = V[i][j];
				int back = V[i][k];
				if (C(a[fro], a[i], a[back])) flag = true;
			}
		}
	}

	if (flag) cout << "YES" << endl;
	else cout << "NO" << endl;


	return 0;
}