#include <iostream>
#include <fstream>
using namespace std;

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

const int maxn = 1e5 + 5;
int Aib[maxn], n, m;

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

int Query(int pos) {
    int sum = 0, i;
    for (i = pos; i; i -= i & (-i)) {
        sum += Aib[i];
    }
    return sum;
}

int Bsearch(int val) {
    int mid, left = 1, right = n, sum;
    while (left <= right) {
        mid = left + ((right - left) >> 1);
        sum = Query(mid);
        if (val > sum) {
            left = mid + 1;
        } else if (val < sum) {
            right = mid -1;
        } else {
            return mid;
        }
    }
    return -1;
}

int main() {
    ios_base :: sync_with_stdio(false);
    int i, x, y, op;
    fin >> n >> m;
    for (i = 1; i <= n; i++) {
        fin >> x;
        Update(i, x);
    }
    while (m--) {
        fin >> op >> x;
        if (op == 0) {
            fin >> y;
            Update(x, y);
        } else if (op == 1) {
            fin >> y;
            fout << Query(y) - Query(x - 1) << "\n";
        } else {
            fout << Bsearch(x) << "\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}