#include <iostream>
#include <cmath>
#include <vector>
#include <map>

using namespace std;

int main() {
    long long n, q;
    cin >> n >> q;

    vector<long long> vals(n);
    for (int i = 0; i < n; ++i) {
        cin >> vals[i];
    }

    vector<pair<int, int>> incr;

    pair<int, int> curr;
    bool started = false;
    for (int i =0; i < n; ++i) {
        if (!started) {
            curr.first = i;
            started = true;
        } else {
            if (vals[i] < vals[i-1]) {
                curr.second = i-1;
                incr.push_back(curr);
                started = false;
                i--;
            }
        }
    }
    if (started)
    {
        curr.second = n-1;
        incr.push_back(curr);
    }
    

    vector<pair<int, int>> qs(n);

    for (long long i = 0; i < q; ++i) {
        long long s, e;
        cin >> s >>e;

        s--;
        e--;

        if (e == s) {
            cout << "YES\n";
            continue;
        }

        bool is_val = false;

        for (int j = 0; j < incr.size(); ++j) {
            if (s >= incr[j].first && s <incr[j].second) {
                if (e <= incr[j].second && e > incr[j].first) {
                    is_val = true;
                    break;
                }
            }
        }

        if (is_val) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    }
}