#include <bits/stdc++.h>
const int N = 1e5, L = 24;
int n, q, a[N + 5];
struct Segment_Tree {
    static const int N = ::N * 4;
    struct Node {
        int l, r;
        std::pair<int, int> s[L + 1];
    }ar[N + 5];
#define mid ((l + r) >> 1)
#define ls (k << 1)
#define rs (k << 1 | 1)
    void pushup(int k) {
        for (int i = 1; i <= L; ++i) {
            auto [x, y] = ar[ls].s[i];
            ar[k].s[i] = {x + ar[rs].s[y].first, ar[rs].s[y].second};
        }
    }
    void build(int k = 1, int l = 1, int r = n) {
        ar[k].l = l, ar[k].r = r;
        if (l < r) build(ls, l, mid), build(rs, mid + 1, r), pushup(k);
        else {
            for (int i = 1; i <= L - a[l]; ++i) ar[k].s[i] = {0, i + a[l]};
            for (int i = L - a[l] + 1; i <= L; ++i) ar[k].s[i] = {1, a[l]};
        }
    }
    void update(int x, int k = 1) {
        if (x > ar[k].r or x < ar[k].l) return ;
        if (ar[k].l == ar[k].r) {
            for (int i = 1; i <= L - a[x]; ++i) ar[k].s[i] = {0, i + a[x]};
            for (int i = L - a[x] + 1; i <= L; ++i) ar[k].s[i] = {1, a[x]};
            return ;
        }
        update(x, ls), update(x, rs), pushup(k);
    }
    std::pair<int, int> query(int l, int r, int v, int k = 1) {
        if (l > ar[k].r or r < ar[k].l) return {0, v};
        if (l <= ar[k].l and r >= ar[k].r) return ar[k].s[v];
        auto [x, y] = query(l, r, v, ls);
        auto [p, q] = query(l, r, y, rs);
        return {x + p, q};
    }
#undef mid
#undef ls
#undef rs
}tr;
int main() {
    std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0);
    std::cin >> n >> q;
    for (int i = 1; i <= n; ++i) std::cin >> a[i];
    tr.build();
    for (int i = 1, op, x, y; i <= q; ++i) {
        std::cin >> op >> x >> y;
        if (op == 1) a[x] = y, tr.update(x);
        else std::cout << tr.query(x, y, L).first << "\n";
    }
    return 0;
}