#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) { return true; }
void showvi(vector<int> v) {
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
void showvl(vector<long long> v) {
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
void showvp(vector<pair<int, int> > v) {
  for (int i = 0; i < v.size(); i++)
    cout << v[i].first << " " << v[i].second << endl;
}
long long fastpower(long long a, long long n, long long p) {
  long long ans = 1;
  while (n > 0) {
    if (n & 1) ans = (ans * a) % p;
    a = (a * a) % p;
    n = n >> 1;
  }
  return ans % p;
}
vector<bool> prime(3000000, true);
void find(int n) {
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  vector<int> up(1, 0), down(1, 0);
  for (int i = 0; i < n - 1; i++) {
    if (v[i] < v[i + 1]) up.push_back(i + 1);
  }
  for (int i = 0; i < n - 1; i++) {
    if (v[i] > v[i + 1]) down.push_back(i + 1);
  }
  while (m--) {
    int l, r;
    cin >> l >> r;
    int lo = 1, hi = up.size() - 1, ansu = l, mid;
    while (lo <= hi) {
      mid = (lo + hi) / 2;
      if (up[mid] < r) {
        if (up[mid] >= l) ansu = up[mid];
        lo = mid + 1;
      } else
        hi = mid - 1;
    }
    lo = 1;
    hi = down.size() - 1;
    int ansl = r;
    while (lo <= hi) {
      mid = (lo + hi) / 2;
      if (down[mid] >= l) {
        if (down[mid] < r) ansl = down[mid];
        hi = mid - 1;
      } else
        lo = mid + 1;
    }
    if (ansu <= ansl)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
