#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long inf = 1e18 * 4;
const long double pai = acos(-1);
int n, m;
int a[100009][3];
struct NODE {
  int mx, idmx, mn1, mn2;
} tree[400009];
NODE merge(NODE a, NODE b) {
  NODE ret;
  if (a.mx > b.mx)
    ret = a;
  else
    ret = b;
  ret.mn1 = min(a.mn1, b.mn1);
  ret.mn2 = min(a.mn2, b.mn2);
  return ret;
}
void build(int node, int l, int r) {
  if (l == r) {
    tree[node] = {a[l][0], l, a[l][1], a[l][2]};
    return;
  }
  build(node * 2, l, (l + r) / 2);
  build(node * 2 + 1, (l + r) / 2 + 1, r);
  tree[node] = merge(tree[node * 2], tree[node * 2 + 1]);
}
NODE query(int node, int l, int r, int s, int e) {
  if (s <= l && e >= r) return tree[node];
  if (s <= (l + r) / 2 && e >= (l + r) / 2 + 1)
    return merge(query(node * 2, l, (l + r) / 2, s, e),
                 query(node * 2 + 1, (l + r) / 2 + 1, r, s, e));
  else if (s <= (l + r) / 2)
    return query(node * 2, l, (l + r) / 2, s, e);
  else
    return query(node * 2 + 1, (l + r) / 2 + 1, r, s, e);
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> a[i][0];
  a[0][1] = 1;
  for (int i = 1; i < n; i++) {
    if (a[i][0] >= a[i - 1][0])
      a[i][1] = a[i - 1][1] + 1;
    else
      a[i][1] = 1;
  }
  a[n - 1][2] = 1;
  for (int i = n - 2; i >= 0; i--) {
    if (a[i][0] >= a[i + 1][0])
      a[i][2] = a[i + 1][2] + 1;
    else
      a[i][2] = 1;
  }
  build(1, 0, n - 1);
  while (m--) {
    int l, r;
    cin >> l >> r, l--, r--;
    NODE ret = query(1, 0, n - 1, l, r);
    int id = ret.idmx;
    int L = l + 1, R = id;
    if (L <= R) {
      if (query(1, 0, n - 1, L, R).mn1 == 1) {
        cout << "No" << endl;
        continue;
      }
    }
    L = id, R = r - 1;
    if (L <= R) {
      if (query(1, 0, n - 1, L, R).mn2 == 1) {
        cout << "No" << endl;
        continue;
      }
    }
    cout << "Yes" << endl;
  }
}
