#include <bits/stdc++.h>

using ll = long long;
using namespace std;

int a[1'000'000];
int p[1'000'000];

void solve() {
	int n, q;
	cin >> n >> q;
	for(int i = 0; i < n; ++i) {
		cin >> a[i];
		if (i > 0) {
			p[i] = p[i - 1] + bool(a[i] - a[i - 1] >= 0);
		}
	}

	while (q--) {
		int l, r;
		cin >> l >> r;
		--l; --r;
		cout << (p[r] - p[l] == r - l ? "YES\n" : "NO\n");
	}
}

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

	solve();
}