#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define For(i, a, n) for(ll i=a;i<n;i++)
#define vec vector
#define sz(x) (ll)x.size()
#define all(x) begin(x), end(x)


template<typename... Args>
void dbg(Args&&... args){
    ((cerr<<args<<" |"),...);
    cerr<<endl;
}

void solve(){
   int n, q; cin >> n >> q; vec<int> a(n);
   For(i, 0, n){
    cin >> a[i];
   }
   set<int> s;
   For(i, 1, n){
    if(a[i] < a[i-1]) s.insert(i);
   }
   For(i, 0, q){
    int a, b; cin >> a >> b;a--;b--;
    a++;
    auto p = s.lower_bound(a);
    if(p == s.end()) {
        cout << "YES" << '\n';
        continue;
    }
    if(*p <= b){
        cout << "NO" << '\n';
        continue;
    }
    cout << "YES" << '\n';
   }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    ll t = 1;//cin>>t;
    while(t--)solve();
}