#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ll n, q;
    cin >> n >> q;
    vector<ll> a;
    vector<pair<ll, ll>> s;
    ll a_i;
    cin >> a_i;
    ll last = a_i;
    ll start = 0;
    for (ll i = 1; i < n; ++i)
    {
        ll a_i;
        cin >> a_i;
        if (a_i < last)
        {
            s.emplace_back(start, i - 1);
            start = i;
        }
        a.emplace_back(a_i);
        last = a_i;
    }
    s.emplace_back(start, n - 1);
    for (ll i = 0; i < q; ++i)
    {
        ll l, r;
        cin >> l >> r;
        r--;
        auto a = lower_bound(s.begin(), s.end(), l, [](const pair<ll, ll>& info, ll value)
        {
            return info.first < value;
        });
        a--;
        ll b = a->second;
        if (b >= r)
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }

    return 0;
}