#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
using i128 = __int128;

const int N = 100010;
const i64 mod = 1e18 + 9;

struct Info {
    int mn, mx;
    i64 s1, s2;
    Info() = default;
    Info(int x) {
        mn = mx = s1 = x;
        s2 = 1ll * x * x % mod;
    }
};

Info operator+(Info a, Info b) {
    Info c;
    c.mn = min(a.mn, b.mn);
    c.mx = max(a.mx, b.mx);
    c.s1 = (a.s1 + b.s1) % mod;
    c.s2 = (a.s2 + b.s2) % mod;
    return c;
}

struct Node {
	int l, r;
	Info info;
} tr[N << 2];
int n, m, w[N];

void pushup(int u) {
    tr[u].info = tr[u << 1].info + tr[u << 1 | 1].info;
}

void build(int u, int l, int r) {
	tr[u] = {l, r, Info(w[l])};
	if (l == r) return;
	int mid = l + r >> 1;
	build(u << 1, l, mid);
	build(u << 1 | 1, mid + 1, r);
	pushup(u);
}

void modify(int u, int x, int v) {
	if (tr[u].l == tr[u].r) return tr[u].info = Info(v), void();
	int mid = tr[u].l + tr[u].r >> 1;
	if (x <= mid) modify(u << 1, x, v);
	else modify(u << 1 | 1, x, v);
	pushup(u);
}

Info query(int u, int l, int r) {
	if (tr[u].l >= l && tr[u].r <= r) return tr[u].info;
	int mid = tr[u].l + tr[u].r >> 1;
	if (r <= mid) return query(u << 1, l, r);
	if (l > mid) return query(u << 1 | 1, l, r);
	return query(u << 1, l, r) + query(u << 1 | 1, l, r);
}

const i64 inv2 = (mod + 1) / 2;

i64 sum(int n, int s, int d) {
    i64 ans = i128(6) * n * s * s % mod;
    (ans += i128(6) * d * (n + 1) * n * s % mod) %= mod;
    (ans += i128(1) * n * (n + 1) * (2 * n + 1) % mod * d * d % mod) %= mod;
    return ans;
}

int main() {
	cin.tie(0)->sync_with_stdio(false);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> w[i];
	build(1, 1, n);
	while (m--) {
	    int op, x, y;
	    cin >> op >> x >> y;
	    if (op == 1) {
	        modify(1, x, y);
	    } else {
	        auto [mn, mx, s1, s2] = query(1, x, y);
	        int t = y - x;
	        if ((mx - mn) % t) {
	            cout << "NO\n";
	            continue;
	        }
	        int d = (mx - mn) / t;
        	i64 tar1 = 1ll * (mn + mx) * (t + 1) / 2 % mod;
			i64 tar2 = sum(y - x + 1, mn - d, d);
	        if (pair(s1, 6ll * s2 % mod) == pair(tar1, tar2)) {
	            cout << "YES\n";
	        } else {
	            cout << "NO\n";
	        }
	    }
	}
	return 0;
}