#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

struct node {
    vector<pii> V; // line, rest
    node() { V.resize(25); }

    void make_leaf(int a) {
        for (int i = 0; i <= 24; i++) {
            V[i] = make_pair((a+i)/24, (a+i)%24);
        }
    }
};

node zero_node;

vector<pii> comb_v(vector<pii> v1, vector<pii> v2) {
    vector<pii> V(25);
    for (int i = 0; i <= 24; i++) {
        int line1 = v1[i].first, rest1 = v1[i].second;
        int line2 = v2[rest1].first, rest2 = v2[rest1].second;
        V[i] = make_pair(line1 + line2, rest2);
    }
    return V;
}

vector<node> seg_tree;

void update(int n, int start, int end, int x, int c) {
    if (start == end) {
        seg_tree[n].make_leaf(c);
        return;
    }

    int mid = (start + end) / 2;
    if (x <= mid) update(2*n, start, mid, x, c);
    else update(2*n+1, mid+1, end, x, c);
    seg_tree[n].V = comb_v(seg_tree[2*n].V, seg_tree[2*n+1].V);
}

vector<pii> query(int n, int start, int end, int left, int right) {
    if (right < start || end < left) return zero_node.V;
    if (left <= start && end <= right) return seg_tree[n].V;

    int mid = (start + end) / 2;
    return comb_v(query(2*n, start, mid, left, right), query(2*n+1, mid+1, end, left, right));
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    zero_node.make_leaf(0);

    int N, M;
    cin >> N >> M;
    seg_tree.resize(4 * (N+2), node());
    int a;
    for (int x = 1; x <= N; x++) {
        cin >> a;
        update(1, 1, N, x, a);
    }

    while (M--) {
        int op;
        cin >> op;
        if (op == 1) {
            int x, c;
            cin >> x >> c;
            update(1, 1, N, x, c);
        }
        else {
            int l, r;
            cin >> l >> r;
            vector<pii> q = query(1, 1, N, l, r);
            cout << q[0].first + (q[0].second != 0) << "\n";
        }
    }
}