//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si inline
#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;ci iinf=INT_MAX;cl 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;}

namespace LinkWish{

	ci N=200005;

	int n,m;
	int a[N];

	struct T{
		ld sn,cs;
		ll mx,mn,tag;
	}t[N<<2];
	si int ls(int x){return x<<1;}
	si int rs(int x){return x<<1|1;}
	si void push_up(int x){
		int lc=ls(x),rc=rs(x);
		t[x].sn=t[lc].sn+t[rc].sn,t[x].cs=t[lc].cs+t[rc].cs;
		t[x].mx=max(t[lc].mx,t[rc].mx),t[x].mn=min(t[lc].mn,t[rc].mn);
	}
	si void update(int x,ll v){
		
		ld sv=sinl(v),cv=cosl(v);
		
		ld tx = t[x].sn, ty = t[x].cs;
		t[x].sn = tx * cv + ty * sv;
		t[x].cs = ty * cv - tx * sv;

		t[x].mn+=v,t[x].mx+=v,t[x].tag+=v;
	}
	si void push_down(int x){
		if(t[x].tag!=0){
			update(ls(x),t[x].tag);
			update(rs(x),t[x].tag);
			t[x].tag=0;
		}
	}
	void build(int x,int l,int r){
		if(l==r){
			t[x].sn=sinl(a[l]),t[x].cs=cosl(a[l]);
			t[x].mn=t[x].mx=a[l];
			return ;
		}
		int mid=(l+r)>>1;
		build(ls(x),l,mid),build(rs(x),mid+1,r);
		push_up(x);
	}
	void modify(int x,int l,int r,int L,int R,int v){
		if(l>=L&&r<=R)return update(x,v);
		push_down(x);
		int mid=(l+r)>>1;
		if(L<=mid)modify(ls(x),l,mid,L,R,v);
		if(R>mid)modify(rs(x),mid+1,r,L,R,v);
		push_up(x);
	}
	ld ask(int x,int l,int r,int goal){
		if(l==r)return t[x].mn;
		push_down(x);
		int mid=(l+r)>>1;
		if(goal<=mid)return ask(ls(x),l,mid,goal);
		return ask(rs(x),mid+1,r,goal);
	}

	ld ress,resc;
	ll Mx,Mn;
	void ask(int x,int l,int r,int L,int R){
		if(l>=L&&r<=R){
			ress+=t[x].sn,resc+=t[x].cs;
			gmax(Mx,t[x].mx),gmin(Mn,t[x].mn);
			return ;
		}
		push_down(x);
		int mid=(l+r)>>1;
		if(L<=mid)ask(ls(x),l,mid,L,R);
		if(R>mid)ask(rs(x),mid+1,r,L,R);
	}
	
	void mian(){
		cin>>n>>m;
		for(int i=1;i<=n;i++)cin>>a[i],a[i]<<=1;

		build(1,1,n);
		while(m--){
			int op,l,r,v;
			cin>>op>>l>>r;
			if(op==1){
				cin>>v,v<<=1;
				modify(1,1,n,l,r,v);
			}
			else{
				Mx=0,Mn=linf,ress=0,resc=0,ask(1,1,n,l,r);
				

				ll mid=(Mx+Mn)>>1;

				ld ssn=sinl(-mid),csn=cosl(-mid);

				//ld s=0;
				//for(int i=1;i<=n;i++){
				//	ld v=ask(1,1,n,i);
				//	cout<<v<<' '<<sinl(v-mid)<<endl;
				//	s+=sinl(v-mid);
				//}
				//cout<<endl;
				//t[x].sn = tx * cv + ty * sv;
				//t[x].cs = ty * cv - tx * sv;

				ress=ress*csn+resc*ssn;

				//cout<<"RESS "<<ress<<' '<<s<<endl;

				if(abs(ress)<=1e-10)cout<<"Yes\n";
				else cout<<"No\n";
			}
		}
	}
}

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;
}