#include<bits/stdc++.h>
#define ll long long
int read(){
	int f=0,s=0; char c=getchar();
	while(c>'9'||c<'0')f=(c=='-'),c=getchar();
	while(c>='0'&&c<='9')s=(s<<3)+(s<<1)+(c^'0'),c=getchar();
	return f?-s:s;
}

#define int long long
const int N=200005;
int n,q;
int a[N];
int o,t1,t2,t3;

const int mod=998244353;
int ksm(int a,int b=mod-2){
	int res=1;
	for(;b;b>>=1,a=1ll*a*a%mod)if(b&1)res=1ll*res*a%mod;
	return res;
}
const int bs=20050913;
const int ibs=665516581;
inline void ad(int &a,int b){ a=a+b>=mod?a+b-mod:a+b; }
int pw[N],ipw[N];

#define ls x<<1
#define rs x<<1|1
#define mi ((l+r)>>1)
#define lson ls,l,mi
#define rson rs,mi+1,r
ll sum0[N<<2];
int sum1[N<<2],sum2[N<<2];
ll lz0[N<<2];
int lz1[N<<2],lz2[N<<2];
#undef int
void up(int x){
	sum0[x]=sum0[ls]+sum0[rs];
	sum1[x]=(sum1[ls]+sum1[rs])%mod;
	sum2[x]=(sum2[ls]+sum2[rs])%mod;
}
void tag0(int x,int l,int r,int k){
	sum0[x]+=1ll*(r-l+1)*k;
	lz0[x]+=k;
}
void tag1(int x,int k1,int k2){
	sum1[x]=1ll*sum1[x]*k1%mod;
	sum2[x]=1ll*sum2[x]*k2%mod;
	lz1[x]=1ll*lz1[x]*k1%mod;
	lz2[x]=1ll*lz2[x]*k2%mod;
}
void down(int x,int l,int r){
	if(lz0[x]){
		tag0(ls,l,mi,lz0[x]);
		tag0(rs,mi+1,r,lz0[x]);
		lz0[x]=0;
	}
	if(lz1[x]!=1){
		tag1(ls,lz1[x],lz2[x]);
		tag1(rs,lz1[x],lz2[x]);
		lz1[x]=lz2[x]=1;
	}
}
void build(int x,int l,int r){
	lz0[x]=0; lz1[x]=lz2[x]=1;
	if(l==r){
		sum0[x]=a[l];
		sum1[x]=pw[a[l]];
		sum2[x]=ipw[a[l]];
		return;
	}
	build(lson); build(rson);
	up(x);
}
void upd(int x,int l,int r,int nl,int nr,int k){
	if(nl<=l&&r<=nr){
		tag0(x,l,r,k);
		tag1(x,pw[k],ipw[k]);
		return;
	}
	down(x,l,r);
	if(mi>=nl)upd(lson,nl,nr,k);
	if(mi<nr)upd(rson,nl,nr,k);
	up(x);
}
ll t;
int pos,neg;
void qry(int x,int l,int r,int nl,int nr){
	if(nl<=l&&r<=nr){
		t+=sum0[x];
		pos=(pos+sum1[x])%mod;
		neg=(neg+sum2[x])%mod;
		return;
	}
	down(x,l,r);
	if(mi>=nl)qry(lson,nl,nr);
	if(mi<nr)qry(rson,nl,nr);
}

int main(){
	pw[0]=ipw[0]=1;
	// cout<<ibs<<endl;
	for(int i=1;i<N;i++)pw[i]=1ll*pw[i-1]*bs%mod;
	for(int i=1;i<N;i++)ipw[i]=1ll*ipw[i-1]*ibs%mod;
	n=read(); q=read();
	for(int i=1;i<=n;i++)a[i]=read();
	build(1,1,n);
	for(int i=1;i<=q;i++){
		o=read();
		if(o==1){
			t1=read(); t2=read(); t3=read();
			upd(1,1,n,t1,t2,t3);
		}
		else{
			t1=read(); t2=read();
			t=pos=neg=0;
			qry(1,1,n,t1,t2);
			if(t%((t2-t1+1)/2)){
				puts("NO");
				continue;
			}
			t/=((t2-t1+1)/2);
			if(1ll*neg*ksm(bs,t%(mod-1))%mod==pos)puts("YES");
			else puts("NO");
		}
	}
	return 0;
}