#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll rng(ll x,ll y){ return x+rnd()%(y-x+1); }
int n,q; ull a[200005];

const ull mod = (ll)1e16 + 2137;

struct mint {
	ull v;

	mint(ull v=0): v(v) {}
};

inline mint operator+(const mint &x, const mint &y) {
	ull t = x.v + y.v;
	if (t >= mod) {
		t -= mod;
	}
	return t;
}

inline mint operator-(const mint &x, const mint &y) {
	ull t = x.v - y.v + mod;
	if (t >= mod) {
		t -= mod;
	}
	return t;
}

inline mint operator*(const mint &x, const mint &y) {
	return (__int128)x.v * (__int128)y.v % mod;
}

inline void operator+= (mint &x, mint y){ x = x + y; }
inline void operator-= (mint &x, mint y){ x = x - y; }

struct Info{
	mint a,b,c; ll mx, mn; mint len;
	Info(){ a.v=b.v=c.v=mx=mn=len.v=0; }
	Info(mint A,mint B,mint C,ll M,ll N,mint L){ a=A, b=B, c=C, mx=M, mn=N, len=L; }
}s[800005];
ll tag[800005];
Info operator+ (Info A,Info B){
	return Info(A.a+B.a, A.b+B.b, A.c+B.c, max(A.mx,B.mx), min(A.mn,B.mn), A.len+B.len);
}
void pushup(int pos){
	s[pos]=s[pos<<1]+s[pos<<1|1];
}
void upd(int pos,ll v){
	s[pos].c += 3 * s[pos].b * v + 3 * s[pos].a * v * v + s[pos].len * v * v * v;
	s[pos].b += 2 * s[pos].a * v + s[pos].len * v * v;
	s[pos].a += s[pos].len * v; 
	s[pos].mx += v; s[pos].mn += v;
	tag[pos] += v;
}
void build(int l,int r,int pos){
	if(l==r){
		ull val = a[l];
		s[pos] = Info(val, val*val, val*val*val, a[l], a[l], 1);
		return;
	}
	int mid=(l+r)>>1;
	build(l,mid,pos<<1); build(mid+1,r,pos<<1|1);
	pushup(pos);
}
void pushdown(int pos){
	if(tag[pos]){
		upd(pos<<1, tag[pos]);
		upd(pos<<1|1, tag[pos]);
		tag[pos]=0;
	}
}
void update(int l,int r,int ql,int qr,ll v,int pos){
	if(ql<=l && r<=qr){ upd(pos, v); return; }
	int mid=(l+r)>>1; pushdown(pos);
	if(ql<=mid) update(l,mid,ql,qr,v,pos<<1);
	if(mid<qr)  update(mid+1,r,ql,qr,v,pos<<1|1);
	pushup(pos);
}
Info ans; bool flg=0;
void query(int l,int r,int ql,int qr,int pos){
	if(ql<=l && r<=qr) {
		if(!flg) ans = s[pos], flg = 1;
		else ans = ans + s[pos];
		return;
	}
	int mid=(l+r)>>1; pushdown(pos);
	if(ql<=mid) query(l,mid,ql,qr,pos<<1);
	if(mid<qr)  query(mid+1,r,ql,qr,pos<<1|1);
}
Info get(int l,int r){
	ans = Info(); flg = 0;
	query(1,n,l,r,1);
	return ans;
}
void procedure(){
	n=read(),q=read();
	for(int i=1;i<=n;i++) a[i]=read();
	build(1, n, 1);
	while(q--){
		int op=read();
		if(op == 1){
			int l=read(), r=read(); ll v=read();
			update(1, n, l, r, v, 1);
		}else{
			int l=read(), r=read();
			Info tmp = get(l, r);

			mint V = tmp.mn + tmp.mx;

			bool flg = 1;
			mint hsh1 = tmp.c;
			mint hsh2 = tmp.len * V * V * V - 3 * tmp.a * V * V + 3 * tmp.b * V - tmp.c;
			flg &= (hsh1.v == hsh2.v);

			hsh1 = tmp.b;
			hsh2 = tmp.len * V * V - 2 * tmp.a  * V + tmp.b;
			flg &= (hsh1.v == hsh2.v);

			hsh1 = tmp.a;
			hsh2 = tmp.len * V - tmp.a;
			flg &= (hsh1.v == hsh2.v);

			puts(flg ? "YES": "NO");
		}
	}
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	// math_init();
	// NTT::init();
	while(T--) procedure();
	return 0;
}