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

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

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

int binc(int s,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(int x,int p)
{
    for(int i=p; i<=N; i+=ub(i))
        AiB[i]+=x;
}

long long int getAiB(int p)
{
    long long int s=0;
    for(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("%d %d",&N,&M);

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

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

    return 0;
}