#include<bits/stdc++.h>
using namespace std;
#define N 100005
const int M=(1<<30)-1;
int a[N],b[N],n,Q;
pair<int,int> dc[N];
struct query{
    int l,r;
    pair<int,int>d[33];
}q[N];
int mn[20][N],mx[20][N],st0[20][N],st1[20][N];
inline int calc(int x,int y){return b[x]>b[y]?x:y;}
inline int gmx(int l,int r){
    if(l>r)return 0;
    int d=__lg(r-l+1);
    return b[calc(mx[d][l],mx[d][r-(1<<d)+1])];
}
int main(){
    scanf("%d%d",&n,&Q);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]),dc[i]={a[i],i};
    sort(dc+1,dc+n+1);
    for(int i=1;i<=n;i++)b[i]=lower_bound(dc+1,dc+n+1,make_pair(a[i],i))-dc;
    for(int i=1;i<=n;i++)mn[0][i]=b[i],mx[0][i]=i;
    for(int j=1;j<19;j++)for(int i=1;i+(1<<j)-1<=n;i++)mn[j][i]=min(mn[j-1][i],mn[j-1][i+(1<<j-1)]),mx[j][i]=calc(mx[j-1][i],mx[j-1][i+(1<<j-1)]);
    for(int i=1;i<=Q;i++)scanf("%d%d",&q[i].l,&q[i].r);
    for(int d=0;d<31;d++){
        for(int i=1;i<=n;i++){
            if((1<<d)&a[i])st0[0][i]=0,st1[0][i]=b[i];
            else st0[0][i]=b[i],st1[0][i]=n+1;
        }
        for(int j=1;j<19;j++)for(int i=1;i+(1<<j)-1<=n;i++)st0[j][i]=max(st0[j-1][i],st0[j-1][i+(1<<j-1)]),st1[j][i]=min(st1[j-1][i],st1[j-1][i+(1<<j-1)]);
        for(int i=1;i<=Q;i++){
            int g=__lg(q[i].r-q[i].l+1);
            int f0=max(st0[g][q[i].l],st0[g][q[i].r-(1<<g)+1]);
            int f1=min(st1[g][q[i].l],st1[g][q[i].r-(1<<g)+1]);
            if(f0<1 || f1>n)q[i].d[d]={n+1,-1};
            else if(f0<f1)q[i].d[d]={f0,f1-1};
            else q[i].d[d]={f1,f0-1};
        }
    }
    for(int i=1;i<=Q;i++){
        if(q[i].l==q[i].r){
            printf("NO\n");
            continue;
        }
        sort(q[i].d,q[i].d+31);
        int g=__lg(q[i].r-q[i].l+1);
        int pos=calc(mx[g][q[i].l],mx[g][q[i].r-(1<<g)+1]);
        int R=min(mn[g][q[i].l],mn[g][q[i].r-(1<<g)+1])-1,lim=max(gmx(q[i].l,pos-1),gmx(pos+1,q[i].r));
        int ans=0;
        for(int j=0;j<31;j++){
            if(q[i].d[j].first>R+1)ans=1;
            R=max(R,q[i].d[j].second);
            if(R>=lim)break;
        }
        if(ans)printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}