#include <bits/stdc++.h>
using namespace std;
int toint(string s) {
  int n;
  istringstream is(s);
  is >> n;
  return n;
}
string tostring(int n) {
  stringstream is;
  is << n;
  return is.str();
}
long long int modulo(int a, int b, int c) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % c;
    }
    y = (y * y) % c;
    b /= 2;
  }
  return x % c;
}
long long mulmod(long long a, long long b, long long c) {
  long long x = 0, y = a % c;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x + y) % c;
    }
    y = (y * 2) % c;
    b /= 2;
  }
  return x % c;
}
int query(const vector<int> &tree, int a, int b) {
  if (a == 0) {
    int sum = 0;
    for (; b >= 0; b = (b & (b + 1)) - 1) sum += tree[b];
    return sum;
  } else {
    return query(tree, 0, b) - query(tree, 0, a - 1);
  }
}
void increase(vector<int> &tree, int k, int inc) {
  for (; k < (int)tree.size(); k |= k + 1) tree[k] += inc;
}
int a[200000];
int dpinc[200000];
int dpdec[200000];
int main() {
  int n, m;
  int i;
  cin >> n >> m;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  dpinc[n - 1] = n - 1;
  for (i = n - 2; i >= 0; i--) {
    if (a[i] <= a[i + 1])
      dpinc[i] = dpinc[i + 1];
    else
      dpinc[i] = i;
  }
  dpdec[0] = 0;
  for (i = 1; i < n; i++) {
    if (a[i] <= a[i - 1])
      dpdec[i] = dpdec[i - 1];
    else
      dpdec[i] = i;
  }
  int l, r;
  int ans;
  int low, high, mid;
  int val;
  while (m--) {
    cin >> l >> r;
    l--;
    r--;
    if ((dpinc[l] >= r || dpdec[r] <= l) || (dpinc[l] >= dpdec[r]))
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}
