#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 3e5 + 9;
const int M = 30;
int n,q;
int a[N];
int op[N],l[N],r[N],k[N];
int cnt;
int bs[M][N*2];
int t[M][N*2];
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<int> dis(0,(1<<M)-1);
int lowbit(int x) {return x & -x;}
void add(int id,int x,int val)
{
    for(int i = x;i<=n;i += lowbit(i))
    {
        t[id][i] += val;
    }
}
int qs(int id,int x)
{
    int ret = 0;
    for(int i = x;i;i -=lowbit(i))
    {
        ret += t[id][i];
    }
    return ret;
}
void solve()
{
    cin >> n >> q;
    set<int> s;
    for(int i = 1;i<=n;i++) cin >> a[i],s.insert(a[i]);
    for(int i = 1;i<=q;i++)
    {
        cin >> op[i];
        if(op[i] == 1)
        {
            cin >> l[i] >> r[i];
            s.insert(r[i]);
        }
        else
        {
            cin >> l[i] >> r[i] >> k[i];
        }
    }
    map<int,int> m;
    for(const int num : s)
    {
        m[num] = ++cnt;
    }
    for(int i = 1;i<=n;i++) a[i] = m[a[i]];
    for(int i = 1;i<=q;i++)
        if(op[i] == 1)
            r[i] = m[r[i]];
    for(int i = 1;i<=cnt;i++)
    {
        int num = dis(gen);
        for(int j = 0;j<M;j++)
        {
            if( (num>>j) & 1 )
            {
                bs[j][i] = 1;
            }
        }
    }
    for(int i = 1;i<=n;i++)
    {
        for(int j = 0;j<M;j++)
        {
            if(bs[j][a[i]])
            {
                //if(j == 1) cerr << j << ' ' << i << '\n';
                add(j,i,1);
            }
        }
    }
    for(int i = 1;i<=q;i++)
    {
        if(op[i] == 1)
        {
            for(int j  = 0;j<M;j++)
            {
                if(bs[j][a[l[i]]])
                {
                    add(j,l[i],-1);
                }
            }
            for(int j = 0;j<M;j++)
            {
                if(bs[j][r[i]])
                {
                    add(j,l[i],1);
                }
            }
            a[l[i]] = r[i];
        }
        else
        {
            bool mark = true;
            for(int j = 0;j<M;j++)
            {
 
                int ret = qs(j,r[i]) - qs(j,l[i]-1);
                if(ret % k[i])
                {
                    cout << "NO\n";
                    mark = false;
                    break;
                }
            }
            if(mark)
            {
                cout << "YES\n";
            }
        }
    }
};
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
 
    int t = 1;
    //cin >> t;
    
    while(t--)
    {
        solve();
    }
    return 0;
}