#include <cstdio>

using namespace std;

const int nmx = 100002;

int n,m,arb[nmx],v[nmx];

int pow2(int val){
    int t = 1;
    while(not(val & 1)){
        val >>= 1;
        t <<= 1;
    }
    return t;
}

void update(int pos, int val){
    while(pos <= n){
        arb[pos] += val;
        pos += pow2(pos);
    }
}

void citire(){
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i){
        scanf("%d", &v[i]);
        update(i,v[i]);
    }
}

int query(int pos){
    int sum = 0;
    while(pos){
        sum += arb[pos];
        pos -= pow2(pos);
    }
    return sum;
}

int search(int val){
    int st = 1, dr = n;
    while(st <= dr){
        int mij = (st + dr)/2, sum = query(mij);
        if(val == sum)
            return mij;
        if(query(mij) > val)
              dr = mij - 1;
        else
            st = mij + 1;
    }
    return -1;
}

int main(){
    freopen("aib.in", "r", stdin);
    freopen("aib.out", "w", stdout);
    citire();
    //for(int i = 1; i <= n; ++i)
      //  printf("%d ", arb[i]);
    int a,b,c;
    for(int i = 1; i <= m; ++i){
        scanf("%d", &c);
        if(not c){
            scanf("%d %d", &a, &b);
            update(a,b);
            continue;
        }
        if(c == 1){
            scanf("%d %d", &a, &b);
            printf("%d\n", query(b) - query(a-1));
            continue;
        }
        scanf("%d", &a);
        printf("%d\n", search(a));
    }
    //for(int i = 1; i <= n; ++i)
    //    printf("%d ", arb[i]);
    return 0;
}