#include <bits/stdc++.h>
#define int long long
#define P 998244353
#define ls(x) ((x)<<1)
#define rs(x) ((x)<<1|1)
using namespace std;
const int N=100005;
int n,q,m,a[N],mx[N<<2],mn[N<<2],sum1[N<<2],sum2[N<<2];
inline int read() {
    int x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
    return x;
}
void push_up(int k){
    sum1[k]=sum1[ls(k)]+sum1[rs(k)];
    sum2[k]=(sum2[ls(k)]+sum2[rs(k)]);
    mx[k]=max(mx[ls(k)],mx[rs(k)]);
    mn[k]=min(mn[ls(k)],mn[rs(k)]);
}
void build(int l,int r,int k){
    if(l==r){
        sum1[k]=mx[k]=mn[k]=a[l];
        sum2[k]=a[l]*a[l]%P;
        return;
    }
    int mid=(l+r)>>1;
    build(l,mid,ls(k));
    build(mid+1,r,rs(k));
    push_up(k);
}
void update(int l,int r,int x,int y,int k){
    if(l==r){
        sum1[k]=mx[k]=mn[k]=y;
        sum2[k]=y*y%P;
        return;
    }
    int mid=(l+r)>>1;
    if(x<=mid) update(l,mid,x,y,ls(k));
    else update(mid+1,r,x,y,rs(k));
    push_up(k);
}
int qma(int l,int r,int x,int y,int k){
    if(x<=l&&r<=y) return mx[k];
    int mid=(l+r)>>1,res=-1e15;
    if(x<=mid) res=max(res,qma(l,mid,x,y,ls(k)));
    if(mid+1<=y) res=max(res,qma(mid+1,r,x,y,rs(k)));
    return res;
}
int qmn(int l,int r,int x,int y,int k){
    if(x<=l&&r<=y) return mn[k];
    int mid=(l+r)>>1,res=1e15;
    if(x<=mid) res=min(res,qmn(l,mid,x,y,ls(k)));
    if(mid+1<=y) res=min(res,qmn(mid+1,r,x,y,rs(k)));
    return res;
}
int qs1(int l,int r,int x,int y,int k){
    if(x<=l&&r<=y) return sum1[k];
    int mid=(l+r)>>1,res=0;
    if(x<=mid) res=res+qs1(l,mid,x,y,ls(k));
    if(mid+1<=y) res=res+qs1(mid+1,r,x,y,rs(k));
    return res;
}
int qs2(int l,int r,int x,int y,int k){
    if(x<=l&&r<=y) return sum2[k];
    int mid=(l+r)>>1,res=0;
    if(x<=mid) res=(res+qs2(l,mid,x,y,ls(k)))%P;
    if(mid+1<=y) res=(res+qs2(mid+1,r,x,y,rs(k)))%P;
    return res;
}
signed main() {
    n=read(),q=read();
    for(int i=1;i<=n;i++){
        a[i]=read();
    }
    build(1,n,1);
    while(q--){
        int op=read(),x=read(),y=read();
        if(op==1){
            update(1,n,x,y,1);
        }
        else{
            int MA=qma(1,n,x,y,1),MN=qmn(1,n,x,y,1);
            int len=y-x+1;
            if(len<=2){
                puts("YES");
            }
            else{
                if((MA-MN)%(len-1)){
                    puts("NO");
                }
                else{
                    int k=(MA-MN)/(len-1);
                    int s1=qs1(1,n,x,y,1),s2=qs2(1,n,x,y,1);
                    int S1=len*MN+len*(len-1)/2*k;
                    int S2=(len*MN%P*MN%P+len*(len-1)%P*MN%P*k%P+len*(len-1)/2*(2*len-1)/3%P*k%P*k%P)%P;
                    // printf("%d %d %d %d\n",s1,s2,S1,S2);
                    if(s1==S1&&s2==S2) puts("YES");
                    else puts("NO");
                }
            }
        }
    }
    return 0;
}