//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,fast-math")
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int __int128
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {
	cerr << "[" << s << "] = [" << x << "]\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {
	for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;
	else if (s[i] == ')' || s[i] == '}') b--;
	else if (s[i] == ',' && b == 0) {
		cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";
		debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);
		break;
	}
}
#ifdef orzz
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define Debug(...)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 100000000000000003;
const int p =   4378930078005897;
const int inf = 0x3f3f3f3f;
const int infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 2e5 + 5;

int n, q, a[_];

int qpow(int x, int y) {
	int res = 1;
	while(y) {
		if(y & 1) res = 1ll *res * x % mod;
		x = 1ll * x * x % mod, y >>= 1;
	} return res;
}

const int lim = 2e10;

struct sgt {
	int tr[_ << 2], tg[_ << 2];
	int mx[_ << 2];
	void up(int o) {
		tr[o] = (tr[o << 1] + tr[o << 1 | 1]);
		mx[o] = max(mx[o << 1], mx[o << 1 | 1]);
	}
	void pd(int o, int l, int r) {
		if(tg[o]) {
			int mid = (l + r) >> 1;
			tr[o << 1] = (tr[o << 1] + 1ll * (mid - l + 1) * tg[o]);
			tr[o << 1 | 1] = (tr[o << 1 | 1] + 1ll * (r - mid) * tg[o]);
			mx[o << 1] += tg[o], mx[o << 1 | 1] += tg[o];
			tg[o << 1] = (tg[o << 1] + tg[o]);
			tg[o << 1|1] = (tg[o << 1|1] + tg[o]);
			tg[o] = 0;
		}
	}
	void build(int o, int l, int r) {
		if(l == r) {
			tr[o] = a[l];
			mx[o] = a[l];
			return;
		}
		int mid = (l + r) >> 1;
		build(o << 1, l, mid),build(o << 1 |1, mid +1, r);
		up(o);
	}
	void upd(int o, int l, int r, int L, int R, int v) {
		if(L <= l && r <= R) {
			tr[o] = (tr[o] + 1ll * (r - l + 1) * v);
			mx[o] += v;
			tg[o] = (tg[o] + v);
			return;
		}
		pd(o, l, r);
		int mid = (l + r) >> 1;
		if(L <= mid) upd(o << 1,l , mid, L, R, v);
		if(R >mid) upd(o << 1 | 1, mid + 1, r, L, R, v);
		up(o);
	}
	int qry(int o, int l, int r, int L, int R) {
		if(L <= l && r <= R) return tr[o];
		int mid = (l + r) >> 1;
		pd(o, l, r);
		int res = 0;
		if(L <= mid) res= qry(o << 1,l , mid, L, R);
		if(R > mid) res = (res + qry(o <<1 | 1, mid + 1, r, L, R));
		return res;
	}
	int qry2(int o, int l, int r, int L, int R) {
		if(L <= l && r <= R) return mx[o];
		int mid = (l + r) >> 1;
		pd(o, l, r);
		int res = 0;
		if(L <= mid) res= qry2(o << 1,l , mid, L, R);
		if(R > mid) res = max(res, qry2(o <<1 | 1, mid + 1, r, L, R));
		return res;
	}
} A;

struct sgt2 {
	int id;
	int tr[_ << 2], tg[_ << 2];
	void up(int o) {
		tr[o] = (tr[o << 1] + tr[o << 1 | 1])%mod;
	}
	void pd(int o, int l, int r) {
		if(tg[o] != 1) {
			tr[o << 1] = tr[o << 1] * tg[o] %mod;
			tr[o << 1 | 1] = tr[o << 1 | 1] * tg[o] % mod;
			tg[o << 1] = tg[o << 1] * tg[o] %mod;
			tg[o << 1 | 1] = tg[o <<1 | 1] * tg[o] %mod;
			tg[o] = 1;
		}
	}
	void build(int o, int l, int r) {
		tg[o] = 1;
		if(l == r) {
			if(id == 1) tr[o] = qpow(p, a[l]);
			else tr[o]= qpow(p, lim - a[l]);
			return;
		}
		int mid = (l + r) >> 1;
		build(o << 1, l, mid),build(o << 1 |1, mid +1, r);
		up(o);
	}
	void upd(int o, int l, int r, int L, int R, int v) {
		if(L <= l && r <= R) {
			tr[o] = tr[o] * v % mod;
			tg[o] = tg[o] * v % mod;
			return;
		}
		pd(o, l, r);
		int mid = (l + r) >> 1;
		if(L <= mid) upd(o << 1,l , mid, L, R, v);
		if(R >mid) upd(o << 1 | 1, mid + 1, r, L, R, v);
		up(o);
	}
	int qry(int o, int l, int r, int L, int R) {
		if(L <= l && r <= R) return tr[o];
		int mid = (l + r) >> 1;
		pd(o, l, r);
		int res = 0;
		if(L <= mid) res= qry(o << 1,l , mid, L, R);
		if(R > mid) res = (res + qry(o <<1 | 1, mid + 1, r, L, R)) % mod;
		return res;
	}
} B, C;

const int invp = qpow(p, mod - 2);

//

bool Med;
signed main() {
	// Mry;
//	freopen("1.txt", "r", stdin);
	n = ri(), q = ri();
	F(i, 1, n) {
		a[i] = ri();
	}
	B.id = 1, C.id = 2;
	A.build(1, 1, n), B.build(1, 1, n), C.build(1, 1, n);
	wi(p *invp % mod);
	while(q--) {
		int id = ri(), l = ri(), r = ri(), v;
		if(id == 1) {
			v = ri();
			A.upd(1, 1, n, l, r, v);
			B.upd(1, 1, n, l, r, qpow(p, v));
			C.upd(1, 1, n, l, r, qpow(invp, v));
		} else {
			int sum = A.qry(1, 1, n, l, r);
			if(sum % ((r - l + 1)/2) != 0) {
				puts("NO");
				continue;
			}
			sum /= ((r - l + 1)/2);
			int mx = A.qry2(1, 1, n, l, r);
			Debug("sum,mx");
			wi(sum, ' '), wi(mx, '\n');
			if(sum < mx) {
				puts("NO");
				continue;
			}
			int w1 = B.qry(1, 1, n, l, r), w2 = C.qry(1, 1, n, l, r);
			Debug("w2");
			wi(w2, '\n');
			w2 = 1ll * w2 * qpow(invp, lim - sum) % mod;
			Debug("sumw1w2");
			wi(sum, ' '), wi(w1, ' '), wi(w2, '\n');
			int zk1 = 0;
			F(i, l, r) {
				int w = A.qry(1, 1, n, i, i);
				zk1 = (zk1 + qpow(p, w)) % mod;
			}
			int zk2 = 0;
			F(i, l, r) {
				int w = A.qry(1, 1, n, i, i);
				zk2 = (zk2 + qpow(p, lim - w)) % mod;
			}
			Debug("zk1zk2");
			wi(zk1, ' '), wi(zk2, '\n');
			if(w1 == w2) {
				puts("YES") ;
			} else {
				puts("NO");
			}
		}
	}
	// Try;
	return 0;
}

/*
10 1
99999 100000 100000 100000 100000 100000 100000 100000 100000 100000
*/