#include <bits/stdc++.h>
using namespace std;
void in() { return; }
template <typename T, typename... Types>
void in(T &a, Types &...b) {
  cin >> (a);
  in(b...);
}
void o() { return; }
template <typename T, typename... Types>
void o(T a, Types... b) {
  cout << (a);
  cout << ' ';
  o(b...);
}
bool sortin(const pair<long long int, long long int> &e,
            const pair<long long int, long long int> &f) {
  return (e.first < f.first);
}
bool POT(long long int x) { return x && (!(x & (x - 1))); }
long long int i, j, k, l, m, n, p, q, r, a, b, c, x, y, z, ts, mn = 1e18,
                                                               mod = 1e9 + 7;
long long int ar[250005], L[250005], R[250005], tem[250005];
int main() {
  {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  };
  ts = 1;
  while (ts--) {
    in(n, m);
    for (long long int i = 1; i <= n; i++) in(ar[i]);
    for (long long int i = 2; i <= n; i++) {
      if (ar[i] > ar[i - 1])
        L[i] = i;
      else
        L[i] = L[i - 1];
    }
    R[n] = n;
    for (long long int i = n - 1; i >= 1; i--) {
      if (ar[i] > ar[i + 1])
        R[i] = i;
      else
        R[i] = R[i + 1];
    }
    while (m--) {
      in(l, r);
      R[l] >= L[r] ? o("Yes") : o("No");
      cout << endl;
    }
  }
}
