#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;

inline char gtc()
{
    static constexpr size_t bufferlen = 5e6;
    static char BB[bufferlen], *S = BB, *T = BB;
    return S == T && (T = (S = BB) + fread(BB, 1, bufferlen, stdin), S == T) ? EOF : *S++;
}

inline int read()
{
    int x = 0, f = 1;
    char ch = gtc();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = gtc();
    }
    while (ch >= '0' && ch <= '9')
        x = (x << 3) + (x << 1) + (ch ^ 48), ch = gtc();
    return x * f;
}

constexpr int NB = 500000;

typedef bitset<NB> bt;
bt a[16];
bt x1, x2;

signed main()
{
    int n = read(), m = read();
    x1.reset();
    x1.set(0);
    for (int i = 0; i < n; i++)
    {
        int x = read(), j = 0;
        while (x > 0)
        {
            if (x & 1)
                a[j] |= x1;
            j++;
            x >>= 1;
        }
        x1 <<= 1;
    }
    while (m--)
    {
        int o = read();
        if (o == 1)
        {
            int l = read(), r = read();
            x1.set();
            x1 >>= (NB - (r - l + 1));
            x1 <<= (l - 1);
            int i = 0;
            while (x1.any() && i < 16)
            {
                x2 = x1;
                x1 &= a[i];
                a[i] ^= x2;
                i++;
            }
        }
        else if (o == 2)
        {
            int l1 = read(), l2 = read(), len = read();
            bool ok = true;
            for (int i = 0; i < 16; i++)
            {
                if (((a[i] >> (l1 - 1)) << (NB - len)) != ((a[i] >> (l2 - 1)) << (NB - len)))
                {
                    ok = false;
                    break;
                }
            }
            if (ok)
                printf("yes\n");
            else
                printf("no\n");
        }
    }

    return 0;
}