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

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

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

void bs(int a) {
    int st = 1, dr = n;
    while (st <= dr) {
        int mij = (st + dr) / 2;
        if (query(mij) >= a)
            dr = mij - 1;
        else
            st = mij + 1;
    }
    ++dr;
    fout << (query(dr) == a ? dr : -1) << "\n";
    return;
}

int main() {
    fin >> n >> m;
    for (int i = 1, el; i <= n; ++i) {
        fin >> el;
        update(i, el);
    }
    while (m--) {
        int a, b, op;
        fin >> op >> a;
        if (op != 2)
            fin >> b;
        if (op == 0)
            update(a, b);
        else if (op == 1)
            fout << query(b) - query(a - 1) << "\n";
        else
            bs(a);
    }
    return 0;
}