#include<bits/stdc++.h>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
using namespace std;
mt19937_64 mt(time(NULL));
typedef unsigned long long ull;
constexpr int M=5e5+5;
constexpr ull mod=1000000007998244353;
int n,q,len;__int128 pw[M],coef[M];ull ans,ans1,ans2,bas;
struct segtree{ull Hash;int mx,len,lazy;}tr[M<<2];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void pushup(int x){
    tr[x].len=tr[ls(x)].len+tr[rs(x)].len;
    tr[x].mx=max(tr[ls(x)].mx,tr[rs(x)].mx);
    tr[x].Hash=(tr[ls(x)].Hash+pw[tr[ls(x)].len]*tr[rs(x)].Hash)%mod;
}
void build(int l,int r,int x){
    if (l==r) return tr[x].Hash=tr[x].mx=read(),tr[x].len=1,void();
    int mid=l+r>>1; build(l,mid,ls(x)); build(mid+1,r,rs(x)); pushup(x);
}
void addtag(int x,int p){tr[x].Hash=(tr[x].Hash+coef[tr[x].len]*p)%mod;tr[x].mx+=p;tr[x].lazy+=p;}
void pushdown(int x){if (tr[x].lazy) addtag(ls(x),tr[x].lazy),addtag(rs(x),tr[x].lazy),tr[x].lazy=0;}
void update(int L,int R,int l=1,int r=n,int x=1){
    if (L<=l&&r<=R) return addtag(x,1);
    int mid=l+r>>1; pushdown(x);
    if (L<=mid) update(L,R,l,mid,ls(x));
    if (R>mid) update(L,R,mid+1,r,rs(x));
    pushup(x);
}
void modify(int l=1,int r=n,int x=1){
    if (tr[x].mx<65536) return;
    if (l==r) return tr[x].Hash=tr[x].mx=0,void();
    int mid=l+r>>1; pushdown(x);
    modify(l,mid,ls(x));modify(mid+1,r,rs(x));
    pushup(x);
}
void query(int L,int R,int l=1,int r=n,int x=1){
    if (L<=l&&r<=R){
        ans=(ans+pw[len]*tr[x].Hash)%mod;
        len+=tr[x].len; return;
    }
    int mid=l+r>>1; pushdown(x);
    if (L<=mid) query(L,R,l,mid,ls(x));
    if (R>mid) query(L,R,mid+1,r,rs(x));
}
int main(){
    n=read();q=read();bas=mt()%mod;
    while (bas<=65536) bas=mt()%mod;
    for (int i=pw[0]=1;i<=n;i++) pw[i]=pw[i-1]*bas%mod;
    for (int i=1;i<=n;i++) coef[i]=(coef[i-1]+pw[i-1])%mod;
    build(1,n,1);while (q--){
        int op=read(),x=read(),y=read();
        if (op==1) {update(x,y);modify();continue;}
        int k=read();
        ans=len=0;query(x,x+k-1);ans1=ans;
        ans=len=0;query(y,y+k-1);ans2=ans;
        puts(ans1==ans2?"yes":"no");
    }
    return 0;
}