#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	vector<vector<int>> g(N);
	REP(i, M) {
		int u, v;
		scanf("%d %d", &u, &v);
		--u; --v;
		g[u].emplace_back(v);
		g[v].emplace_back(u);
	}
	puts([&]() -> bool {
		REP(i, N) {
			REP(j, g[i].size()) FOR(k, j + 1, g[i].size()) {
				int u = g[i][j];
				int v = g[i][k];
				if (A[i] == A[u] || A[u] == A[v] || A[i] == A[v]) continue;
				if (A[u] > A[i] && A[i] < A[v]) return true;
				if (A[u] < A[i] && A[i] > A[v]) return true;
			}
		}
		return false;
	}() ? "YES": "NO");
}