#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int n, m, v[100005], aib[100005];

void update(int a, int b) {
    for (int i = a; i <= n; i += i & (-i))
        aib[i] += b;
    return;
}

int query(int a) {
    int rez = 0;
    for (int i = a; i >= 1; i -= i & (-i))
        rez += aib[i];
    return rez;
}

void binary_search(int val) {
    int st = 0, dr = n;
    while (st <= dr) {
        int mij = (st + dr) / 2, sum = query(mij);
        if (sum >= val)
            dr = mij - 1;
        else
            st = mij + 1;
    }
    fout << dr + 1 << "\n";
    return;
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        for (int j = i; j > i - (i & (-i)); --j)
            aib[i] += v[j];
    }
    while (m--) {
        int op, a, b;
        fin >> op >> a;
        if (op == 2) {
            binary_search(a);
            continue;
        }
        fin >> b;
        if (op == 0)
            update(a, b);
        else
            fout << query(b) - query(a - 1) << "\n";
    }
    return 0;
}