#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

const int NMAX = 1e5+5;
int aib[NMAX], n;

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

int query(int pos) {
    int res = 0;
    for (int x = pos; x > 0; x -= (x&(-x))) {
        res += aib[x];
    }
    return res;
}

int main() {

    int q;
    fin >> n >> q;
    for (int i = 1; i <= n; i++) {
        int x;
        fin >> x;
        update(i, x);
    }

    while (q--) {
        int cer;
        fin >> cer;
        if (cer == 0) {
            int a, b;
            fin >> a >> b;
            update(a, b);
        } else if (cer == 1) {
            int a, b;
            fin >> a >> b;
            fout << (query(b) - query(a - 1)) << '\n';
        } else {
            int a;
            fin >> a;

            int k = 0;
            for (int p = 16; p >= 0; p--) {
                if (k + (1 << p) > n)
                    continue;

                if (query(k + (1 << p)) <= a)
                    k += (1 << p);
            }

            fout << k << '\n';
        }
    }



    return 0;
}