#include<bits/stdc++.h>
#define ub(x) (x&(-x))
using namespace std;

long long int N,M,x;
long long int AiB[100005];
long long int d,p,k;

long long int max2(long long int x) {
    long long int p=1;
    while(p*2<=x)
        p*=2;
    return p;
}

long long int binc(long long int s,long long int k) {
    if(s==AiB[k])
        return k;
    else if(k%2==1 || k>N)
        return -1;
    else if(s>AiB[k])
        return binc(s-AiB[k],k+ub(k)/2);
    else if(s<AiB[k])
        return binc(s,k-ub(k)/2);
}

void addAiB(long long int x,long long int p) {
    for(long long int i=p; i<=N; i+=ub(i))
        AiB[i]+=x;
}

long long int getAiB(long long int p) {
    long long int s=0;
    for(long long int i=p; i>0; i-=ub(i))
        s+=AiB[i];
    return s;
}

int main() {
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);

    scanf("%lli %lli",&N,&M);

    for(long long int i=1; i<=N; i++) {
        scanf("%lli",&x);
        addAiB(x,i);
    }

    for(long long int i=1; i<=M; i++) {
        scanf("%lli",&d);
        if(d==0) {
            scanf("%lli %lli",&p,&k);
            addAiB(k,p);
        } else if(d==1) {
            scanf("%lli %lli",&p,&k);
            printf("%lli\n",getAiB(k)-getAiB(p-1));
        } else if(d==2) {
            scanf("%lli",&p);
            printf("%lli\n",binc(p,max2(N)));
        }
    }

    return 0;
}