#include <bits/stdc++.h>

using namespace std;

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

int n, q, c, x, y, aib[100005];

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

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

int cautareBinara(int x) {
    int st = 1, dr = n;
    while(st <= dr) {
        int mid = (st + dr) / 2;
        int val = query(mid);
        if(val == x) {
            return mid;
        } else if(val < x) {
            st = mid + 1;
        } else {
            dr = mid - 1;
        }
    }
    return -1;
}

int main() {
    fin >> n >> q;
    for(int i = 1; i <= n; i++) {
        fin >> x;
        update(i, x);
    }
    for(int i = 1; i <= q; i++) {
        fin >> c >> x;
        if(c == 0) {
            fin >> y;
            update(x, y);
        } else if(c == 1) {
            fin >> y;
            fout << (query(y) - query(x - 1)) << "\n";
        } else if(c == 2) {
            fout << cautareBinara(x) << "\n";
        }
    }
    fin.close();
    return 0;
}