#include <cstdio>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
#define MAX 100001

int a[MAX], n, m;

int query(int i) {
    int r = 0;
    while (i > 0) {
        r += a[i];
        i -= i & -i;
    }
    return r;
}

void update(int i, int x) {
    while (i <= n) {
        a[i] += x;
        i += i & -i;
    }
}

int caut(int x) {
    int l = 1, r = n, m;
    while (r-l > 1) {
        m = (l + r) / 2;
        if (query(m) >= x) r = m; else l = m;
    }
    return query(l) == x ? l : query(r) == x ? r : -1;
}

int main()
{
    int op, a, b;

    f >> n >> m;
    for (int i = 1; i <= n; i++) {
        f >> b;
        update(i, b);
    }
    for (int i = 1; i <= m; i++) {
        f >> op;
        if (op == 0) {
            f >> a >> b;
            update(a, b);
        } else
        if (op == 1) {
            f >> a >> b;
            g << query(b) - query(a-1) << "\n";
        } else {
            f >> a;
            g << caut(a) << "\n";
        }
    }

    return 0;
}