#include <fstream>

using namespace std;

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

const int DIM = 100010;

int n, m, x;
int aib[DIM];

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 i = pos; i > 0; i -= (i & -i))
        res += aib[i];
    return res;
}

int binarySearch(int val) {
    int left = 1, right = n;
    while (left <= right) {
        int middle = (left + right) / 2;
        int midVal = query(middle);
        if (midVal == val)
            return middle;

        if (midVal < val)
            left = middle + 1;
        else
            right = middle - 1;
    }
    return -1;
}

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

    for (int i = 1; i <= m; i++) {
        int cmd;
        fin >> cmd;

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

    return 0;
}