#include <bits/stdc++.h>
using namespace std;

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

int n, m, aib[100005];

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

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

int bs(int x) {
    int l = 0, r = n, ans = -1;
    while(l <= r) {
        int m = l+(r-l)/2;
        int q = query(m);
        if(q >= x) {
            ans = m;
            r = m-1;
        } else {
            l = m+1;
        }
    }
    if(ans == -1 || query(ans) == x) return ans;
    return -1;
}

int main() {
    fin >> n >> m;
    for(int i = 1; i <= n; i++) {
        int a;
        fin >> a;
        update(a, i);
    }
    while(m--) {
        int t, a, b;
        fin >> t;
        if(t == 0) {
            fin >> a >> b;
            update(b, a);
        } else if(t == 1) {
            fin >> a >> b;
            fout << query(b) - query(a-1) << '\n';
        } else {
            fin >> a;
            fout << bs(a) << '\n';
        }
    }
}