#include<bits/stdc++.h>

const int N=;

using namespace std;

typedef long long ll;

const int yql=1e9+;

int n,m;ll a[N],s[N];

ll sum,sumx;ll mn,mx,LastOrder=;

struct Segment_Tree{

#define lson (o<<1)

#define rson (o<<1|1)

    ll sumv[N<<],sum2[N<<];ll maxv[N<<],minv[N<<];

    inline void pushup(int o){

        sumv[o]=sumv[lson]+sumv[rson];

        sum2[o]=(sum2[lson]+sum2[rson])%yql;

        minv[o]=min(minv[lson],minv[rson]);

        maxv[o]=max(maxv[lson],maxv[rson]);

    }

    inline void build(int o,int l,int r){

        if(l==r){

            sumv[o]=a[l];sum2[o]=1LL*a[l]*a[l]%yql;maxv[o]=a[l];minv[o]=a[l];

            return;

        }

        int mid=(l+r)>>;

        build(lson,l,mid);build(rson,mid+,r);

        pushup(o);

    }

    inline void change(int o,int l,int r,int q){

        if(l==r){sumv[o]=a[l];sum2[o]=1LL*a[l]*a[l]%yql;maxv[o]=a[l];minv[o]=a[l];return;}

        int mid=(l+r)>>;

        if(q<=mid)change(lson,l,mid,q);

        if(q>mid)change(rson,mid+,r,q);

        pushup(o);

    }

    inline void query(int o,int l,int r,int ql,int qr){

        if(ql<=l&&r<=qr){mx=max(mx,maxv[o]);mn=min(mn,minv[o]);sum+=sumv[o];sumx=(sumx+sum2[o])%yql;return;}

        int mid=(l+r)>>;

        if(ql<=mid)query(lson,l,mid,ql,qr);

        if(qr>mid)query(rson,mid+,r,ql,qr);

    }

}T;

inline ll read(){

    ll f=,x=;char ch;

    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');

    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');

    return f*x;

}

int main(){

    n=read();m=read();for(int i=;i<=n;i++)a[i]=read();

    s[]=;for(int i=;i<n;i++)s[i]=(s[i-]+i*i)%yql;

    T.build(,,n);

    while(m--){

        int opt=read();

        if(opt==){

            int x=read(),y=read();x^=LastOrder;y^=LastOrder;

            a[x]=y;T.change(,,n,x);

        }

        if(opt==){

            mx=-,mn=yql+;sum=;sumx=;

            ll l=read(),r=read(),k=read();

            l^=LastOrder;r^=LastOrder;k^=LastOrder;

            if(l==r){puts("Yes");LastOrder++;continue;}

            T.query(,,n,l,r);ll size=r-l+;//printf("%lld %lld\n",mx,mn);

            if(mx-mn!=k*(size-)){puts("No");continue;}

            ll tmp1=(mx+mn)*size/,tmp2=(mn*mn%yql*size+mn*k%yql*size%yql*(size-)%yql+k*k%yql*s[size-])%yql;

        //    printf("%lld %lld %lld %lld\n",tmp1,sum,tmp2,sumx);

            if(tmp1==sum&&tmp2==sumx){LastOrder++;puts("Yes");}else puts("No");

        }

    }

}