#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e5 + 500;
const int OFF = (1 << 18);
const int MOD = 998244353;
const int BS = 31337;

inline int add(int A, int B) {
	if(A + B >= MOD) return A + B - MOD;
	return A + B;
}

inline int sub(int A, int B) {
	if(A - B < 0) return A - B + MOD;
	return A - B;
}

inline int mul(int A, int B) {
	return A * 1ll * B % MOD;
}

const int STEP = 50000;

int pott1[N], pott2[N];

inline int pot(int A, ll B) {
	if(B < 0) B = (B % (MOD - 1)) + (MOD - 1);
	B %= (MOD - 1);
	int ret = 1;
	for(; B ; B >>= 1) {
		if(B & 1) ret = mul(ret, A);
		A = mul(A, A);
	}
	return ret;
}

inline int fast_pot(ll B) {
	if(B < 0) B = (B % (MOD - 1)) + (MOD - 1);
	B %= (MOD - 1);
	return mul(pott1[B % STEP], pott2[B / STEP]);
}

int T[2 * OFF], rT[2 * OFF], prop[2 * OFF];
ll Tsum[2 * OFF];

void refresh(int x, int len) {
	if(!prop[x]) return;
	Tsum[x] += (ll)prop[x] * len;
	T[x] = mul(T[x], fast_pot(prop[x]));
	rT[x] = mul(rT[x], fast_pot(-prop[x]));
	if(x < OFF) {
		prop[2 * x] += prop[x];
		prop[2 * x + 1] += prop[x];
	}	
	prop[x] = 0;
}

void update(int i, int a, int b, int lo, int hi, int kol) {
	if(lo <= a && b <= hi) {
		prop[i] += kol; refresh(i, b - a + 1);
		return;
	}
	refresh(i, b - a + 1);
	if(a > hi || b < lo) return;
	update(2 * i, a, (a + b) / 2, lo, hi, kol);
	update(2 * i + 1, (a + b) / 2 + 1, b, lo, hi, kol);
	T[i] = add(T[2 * i], T[2 * i + 1]);
	rT[i] = add(rT[2 * i], rT[2 * i + 1]);
	Tsum[i] = Tsum[2 * i] + Tsum[2 * i + 1];
}

int ob_hsh, rev_hsh;
ll sum_q;

void query(int i, int a, int b, int lo, int hi) {
	refresh(i, b - a + 1);
	if(lo <= a && b <= hi) {
		sum_q += Tsum[i];
		ob_hsh = add(ob_hsh, T[i]);
		rev_hsh = add(rev_hsh, rT[i]);
		return;
	}
	if(a > hi || b < lo) return;
	query(2 * i, a, (a + b) / 2, lo, hi);
	query(2 * i + 1, (a + b) / 2 + 1, b, lo, hi);
}

void precompute() {
	pott1[0] = pott2[0] = 1;
	for(int i = 1;i < STEP;i++)
		pott1[i] = mul(pott1[i - 1], BS);
	int korak = mul(pott1[STEP - 1], BS);
	for(int i = 1;i < STEP;i++)
		pott2[i] = mul(pott2[i - 1], korak);
}

int main() {
	precompute();
	int n, q; scanf("%d%d", &n, &q);
	for(int i = 0;i < n;i++) {
		int a; scanf("%d", &a);
		Tsum[OFF + i] = a;
		T[OFF + i] = fast_pot(a);
		rT[OFF + i] = fast_pot(-a);
	}
	for(int i = OFF - 1; i ;i--) {
		T[i] = add(T[2 * i], T[2 * i + 1]);
		rT[i] = add(rT[2 * i], rT[2 * i + 1]);
		Tsum[i] = Tsum[2 * i] + Tsum[2 * i + 1];
	}
	for(;q--;) {
		int ty, l, r, v;
		scanf("%d%d%d", &ty, &l, &r);l--, r--;
		if(ty == 1) {
			scanf("%d", &v);
			update(1, 0, OFF - 1, l, r, v);
		} else {
			sum_q = 0; ob_hsh = rev_hsh = 0;
			query(1, 0, OFF - 1, l, r);
			ll val = sum_q / ((r - l + 1) / 2);
			printf((ob_hsh == mul(rev_hsh, fast_pot(val))) ? "YES\n" : "NO\n");
		}
	}
	return 0;
}