#include <bits/stdc++.h>

using namespace std;
const char iname[] = "aib.in";
const char oname[] = "aib.out";
const int MAXN = 100005;

int n, m, tree[MAXN];

void add(int index, int val){
    while(index <= n){
        tree[index] += val;
        index += index & (-index);
    }
}

int getSum(int index){
    int sum = 0;
    while(index > 0){
        sum += tree[index];
        index -= index & (-index);
    }
    return sum;
}

void read(){
    freopen(iname, "r", stdin);
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i){
        int aux;
        scanf("%d", &aux);
        add(i, aux);
    }
}
int find(int val){
    int index = 0;
    int bitmask = 1;
    while(bitmask <= n) bitmask <<= 1;
    bitmask >>=1;
    while((bitmask) && (index < n)){
        int tIndex = index + bitmask;
        if(val == tree[tIndex]) return tIndex;
        else if(val > tree[tIndex]){
            index += bitmask;
            val -= tree[tIndex];
        }
        bitmask >>=1;
    }
    if(val != 0)
        return -1;
    else
        return index;
}
void solve(){
    freopen(oname, "w", stdout);
    for(int i = 0; i < m; ++i){
        int c, a, b;
        scanf("%d", &c);
        if(c == 2) scanf("%d", &a),printf("%d\n", find(a));
        else{
            scanf("%d %d", &a, &b);
            if(c == 0) add(a, b);
            if(c == 1) printf("%d\n", getSum(b) - getSum(a-1));
        }
    }
}
int main()
{
    read();
    solve();
    return 0;
}