/**
 *  written by Binoy Barman .
**/

#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
#define all(v) v.begin(), v.end()
#define Too_Many_Jobs int tts, tc = 1; cin >> tts; hell: while(tts--)
#define Dark_Lord_Binoy ios_base::sync_with_stdio(false); cin.tie(NULL);

#ifdef LOCAL
#include "unravel.hpp"
#else
#define dbg(...) 42
#endif
#define ll long long

const int N = 2e5 + 9;

int a[N];
struct SegmentTree {
    int f[4 * N], s[4 * N];
    bool ok[4 * N];
    SegmentTree() {
        for (int i = 0; i < 4 * N; i++) {
            f[i] = s[i] = 0;
            ok[i] = false;
        }
    }
    void build(int n, int b, int e) {
        if (b == e) {
            f[n] = a[b];
            s[n] = a[b];
            ok[n] = true;
            return;
        }
        int mid = (b + e) >> 1, l = n << 1, r = l | 1;
        build(l, b, mid);
        build(r, mid + 1, e);
        f[n] = f[l];
        s[n] = s[r];
        ok[n] = false;
        if(ok[l] == true && ok[r] == true && (s[l] <= f[r])) ok[n] = true;
    }
    void upd(int n, int b, int e, int i, int x) {
        if (b > i || e < i) return;
        if (b == e && b == i) {
            f[n] = x; 
            s[n] = x; 
            ok[n] = true; 
            return;
        }
        int mid = (b + e) >> 1, l = n << 1, r = l | 1;
        upd(l, b, mid, i, x);
        upd(r, mid + 1, e, i, x);
        f[n] = f[l];
        s[n] = s[r];
        ok[n] = false;
        if(ok[l] == true && ok[r] == true && (s[l] <= f[r])) ok[n] = true;
    }
    bool query(int n, int b, int e, int i, int j) {
        if (b > j || e < i) return true; // return approriate value
        if (b >= i && e <= j) return ok[n];
        int mid = (b + e) >> 1, l = n << 1, r = l | 1;
        bool L = query(l, b, mid, i, j);
        bool R = query(r, mid + 1, e, i, j);
        if(L && R) return true;
        else return false;
    }
}t;

int32_t main() {
Dark_Lord_Binoy
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    t.build(1, 1, n);
    // cin >> q;
    while(q--) {
        int c, l, r;
        cin >> c >> l >> r;
        if(c == 1) {
            t.upd(1, 1, n, l, r);
        }
        else {
            cout << (t.query(1, 1, n, l, r) ? "YES" : "NO") << nl;
        }
    }

    return 0;
}