#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
typedef pair<int, int> pii;
const int N=1e5+10,inf=1e5;

struct node
{
    int l,r;
    int sum1,sum2;
    int lazy1,lazy2;
}tr[N<<2];
int a[N];

void pushup(int u)
{
    tr[u].sum1=tr[u<<1].sum1+tr[u<<1|1].sum1;
    tr[u].sum2=tr[u<<1].sum2+tr[u<<1|1].sum2;
}

void build(int u,int l,int r)
{
    tr[u]={l,r,0,0,0,inf};
    if(l==r)
    {
        tr[u].sum1=a[l]*l;
        tr[u].sum2=a[l];
        return ;
    }
    int mid=(l+r)>>1;
    build(u<<1,l,mid);
    build(u<<1|1,mid+1,r);
    pushup(u);
}

void change(int u,int op,int x)
{
    if(op==1)
    {
        tr[u].sum1+=x*(tr[u].r*(tr[u].r+1)/2-tr[u].l*(tr[u].l-1)/2);
        tr[u].sum2+=(tr[u].r-tr[u].l+1)*x;
        tr[u].lazy2=inf;
        tr[u].lazy1+=x;
    }
    else
    {
        tr[u].sum1=x*(tr[u].r*(tr[u].r+1)/2-tr[u].l*(tr[u].l-1)/2);
        tr[u].sum2=(tr[u].r-tr[u].l+1)*x;
        tr[u].lazy1=0;
        tr[u].lazy2=x;
    }
}

void pushdown(int u)
{
    if(tr[u].lazy2!=inf)
    {
        change(u<<1,2,tr[u].lazy2);
        change(u<<1|1,2,tr[u].lazy2);
        tr[u].lazy2=inf;
    }
    if(tr[u].lazy1!=0)
    {
        change(u<<1,1,tr[u].lazy1);
        change(u<<1|1,1,tr[u].lazy1);
        tr[u].lazy1=0;
    }
}

void modify(int u,int l,int r,int op,int x)
{
    if(tr[u].l>=l&&tr[u].r<=r)
    {
        change(u,op,x);
        return ;
    }
    int mid=(tr[u].l+tr[u].r)>>1;
    pushdown(u);
    if(l<=mid) modify(u<<1, l, r, op, x);
    if(r>mid) modify(u<<1|1, l, r, op, x);
    pushup(u);
}

pii query(int u,int l,int r)
{
    if(tr[u].l>=l&&tr[u].r<=r)
    {
        return {tr[u].sum1,tr[u].sum2};
    }
    int mid=(tr[u].l+tr[u].r)>>1;
    pushdown(u);
    int res1=0,res2=0;
    if(l<=mid)
    {
        pii xx=query(u<<1, l, r);
        res1+=xx.first;
        res2+=xx.second;
    }
    if(r>mid)
    {
        pii xx=query(u<<1|1, l, r);
        res1+=xx.first;
        res2+=xx.second;
    }
    return {res1,res2};
}

void solve()
{
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++) cin>>a[i];
    build(1,1,n);
    while(q--)
    {
        int op,l,r;
        cin>>op>>l>>r;
        if(op==1||op==2)
        {
            int x;
            cin>>x;
            modify(1, l, r, op, x);
        }
        else
        {
            auto [x,y]=query(1, l, r);
            int res1=x-(l-1)*y;
            int res2=y;
            if(res2==0)
            {
                if(res1==res2) cout<<"Yes\n";
                else cout<<"No\n";
            }
            else
            {
                int k=res1/res2;
                if(res1==res2*k&&k>=1&&k<=r-l+1)
                    cout<<"Yes\n";
                else cout<<"No\n";
            }
        }
    }
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
//    cin>>t;
    while(t--)
        solve();
    return 0;
}