//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;
typedef long double ld;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}
typedef unsigned long long ull;
namespace LinkWish{

	const int MAXN = 200005, B = 6;
	//const int C[4][4] = {1, 0, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 1, 3, 3, 1};
	int C[B][B];
	int a[MAXN];
	namespace sgt {
		ull val[MAXN << 2][B]; long long tag[MAXN << 2]; long long mn[MAXN << 2], mx[MAXN << 2];
		// sum (x^k)
		void addtag(int rt, long long w) {
			tag[rt] += w; mn[rt] += w; mx[rt] += w;
			for (int i = B - 1; ~i; i--) {
				ull pw = w; for (int j = i - 1; ~j; j--, pw *= w) {
					val[rt][i] += val[rt][j] * C[i][j] * pw;
				}
			}
		}
		void pushdown(int rt) {
			if (tag[rt]) addtag(rt << 1, tag[rt]), addtag(rt << 1 | 1, tag[rt]), tag[rt] = 0;
		}
		void pushup(int rt) {
			for (int _ = 0; _ < B; _++) val[rt][_] = val[rt << 1][_] + val[rt << 1 | 1][_];
			mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]);
			mn[rt] = min(mn[rt << 1], mn[rt << 1 | 1]);
		}
		void modify(int rt, int l, int r, int x, int y, int w) {
			if (x <= l && r <= y) return addtag(rt , w); int mid = (l + r) >> 1; pushdown(rt);
			if (x <= mid) modify(rt << 1, l, mid, x, y, w);
			if (y > mid) modify(rt << 1 | 1, mid + 1, r, x, y, w); pushup(rt);
		}
		ull ret[B]; long long X, N;
		void query(int rt, int l, int r, int x, int y) {
			if (x <= l && r <= y) {
				X = max(X, mx[rt]); N = min(N, mn[rt]);
				for (int i = 0; i < B; i++) ret[i] += val[rt][i];
				return;
			}
			int mid = (l + r) >> 1; pushdown(rt);
			if (x <= mid) query(rt << 1, l, mid, x, y);
			if (y > mid) query(rt << 1 | 1, mid + 1, r, x, y);
		}
		void build(int rt, int l, int r) {
			if (l == r) {
				mn[rt] = mx[rt] = a[l];
				ull pw = 1; for (int i = 0; i < B; i++, pw *= a[l]) val[rt][i] = pw; return;
			} int mid = (l + r) >> 1; build(rt << 1, l, mid); build(rt << 1 | 1, mid + 1, r); pushup(rt);
		}
	}
	void mian() {
		for (int i = 0; i < B; i++) {
			C[i][0] = 1; for (int j = 1; j <= i; j++) C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
		}
		int n, m; scanf("%d %d", &n, &m);
		//printf("? %d %d\n", n, m);
		for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[i] *= 2;
		sgt::build(1, 1, n);
		while (m--) {
			int op, l, r, v; scanf("%d %d %d", &op, &l, &r);
			//printf("? %d %d %d\n", op, l, r);
			if (op == 1) {
				scanf("%d", &v); sgt::modify(1, 1, n, l, r, v * 2);
			}
			else {
				sgt::X = 0; sgt::N = 0x3f3f3f3f3f3f3f3f;
				memset(sgt::ret, 0, sizeof sgt::ret);
				sgt::query(1, 1, n, l, r);
				//for (int i = 0; i < B; i++) printf("%llu\n", sgt::ret[i]);
				long long mid = (sgt::X + sgt::N) / 2; ull fvv = -mid;
				for (int i = B - 1; ~i; i--) {
					ull pw = fvv; for (int j = i - 1; ~j; j--, pw *= fvv) {
						sgt::ret[i] += sgt::ret[j] * C[i][j] * pw;
					}
				}
				bool flg = 1; for (int i = 1; i < B; i += 2) flg &= sgt::ret[i] == 0;
				//bool flg = sgt::ret[1] == 0 && sgt::ret[3] == 0;
				if (flg == 1) puts("Yes");else puts("No");
			}
		}
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}