#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m, a[N], lef = 1e9, rig = - 1e9, op, l, r, x, v, j;
struct Tree{int l, r;}tree[N << 2];
int ls (int x){return x << 1;}
int rs (int x){return x << 1 | 1;}
void push_up (int x){tree[x].l = tree[ls (x)].l, tree[x].r = tree [rs (x)].r;}
void build (int x, int l, int r, int dl, int dr)
{
    tree[x].l = dl, tree[x].r = dr;
    if (l == r)return;
    int mid = (l + r) >> 1;
    build (ls (x), l, mid, dl, a[mid]);
    build (rs (x), mid + 1, r, a[mid + 1], dr);
}
void change (int x, int d)
{
    if (tree[x].l == tree[x].r){tree[x].l = tree[x].r = d;return;}
    if (tree[x].l > d)tree[x].l = d;
    if (tree[x].r < d)tree[x].r = d;
}
void update (int x, int l, int r, int L, int R, int d)
{
    if (L <= l && r <= R)
    {
        change (x, d);
        return;
    }
    int mid = (l + r) >> 1;
    update (ls (x), l, mid, L, R, d);
    update (rs (x), mid + 1, r, L, R, d);
    push_up (x);
}
bool query (int x, int l, int r, int L, int R, int d)
{
    if (L <= l && r <= R)return (tree[x].l < d && d < tree[x].r);
    int mid = (l + r) >> 1, ans = 0;
    if (L <= mid)ans |= query (ls (x), l, mid, L, R, d);
    if (mid < R)ans |= query (rs (x), mid + 1, r, L, R, d);
    return ans;
}
signed main ()
{
	ios::sync_with_stdio (0), cin.tie (0), cout.tie (0);
	freopen ("guess.in", "r", stdin);
	freopen ("guess.out", "w", stdout);
	cin >> n >> m;
    for (int i = 1; i <= n; ++ i){cin >> a[i];lef = min (lef, a[i]);rig = max (rig, a[i]);}
    build (1, 1, n, lef, rig);
    while (m --)
    {
        cin >> op;
        if (op == 1)
        {
            cin >> j >> v;
            update (1, 1, n, j, j, v);
        }
        else
        {
            cin >> l >> r >> x;
            cout << (query (1, 1, n, l, r, x) ? "Yes\n" : "No\n");
        }
    }
	return 0;
}