#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e6 + 1e3, mod = 1e9 + 7, inf = 1e9;
long long n, m, x1, d, z, t, sum, x, y, maxi, mini, ans, dp[MAXN], a[MAXN];
string s;
vector<pair<long long, long long> > v;
int main() {
  ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> a[i];
  bool flag = false;
  for (int i = 1; i < n; i++) {
    if (flag) {
      if (a[i] > a[i - 1]) {
        flag = false;
        v.push_back(make_pair(x, i - 1));
        x = y;
      }
      if (a[i] < a[i - 1]) {
        y = i;
      }
    } else {
      if (a[i] < a[i - 1]) {
        y = i;
      }
      if (a[i] < a[i - 1]) {
        flag = true;
      }
    }
  }
  v.push_back(make_pair(x, n - 1));
  sort(v.begin(), v.end());
  dp[0] = v[0].second;
  for (int i = 1; i < v.size(); i++) {
    dp[i] = max(dp[i - 1], v[i].second);
  }
  while (m--) {
    cin >> x >> y;
    x--, y--;
    long long b = 0, e = (long long)v.size(), mid = 0;
    while (e - b > 1) {
      mid = (e + b) / 2;
      if (v[mid].first > x) {
        e = mid;
      } else {
        b = mid;
      }
    }
    if (v[b].first > x) {
      cout << "No" << '\n';
      continue;
    }
    if (dp[b] >= y) {
      cout << "Yes" << '\n';
      continue;
    } else {
      cout << "No" << '\n';
      continue;
    }
  }
}
