#include<stdio.h>
using namespace std;
int n,m,i,aib[100001],t,optiune,a,b,npow2=1;
void update(int nod,int value)
{
    while(nod<=n)
    {
        aib[nod]+=value;
        nod+=nod&(nod^(nod-1));
    }
    return;
}
int solve1(int x)
{
    int suma=0;
    while(x>0)
    {
        suma+=aib[x];
        x-=x&(x^(x-1));
    }
    return suma;
}
int solve2(int a)
{
    int x=npow2;
    int i=0;
    while(x>0)
    {
        if(i+x<=n)
        {
            if(a>=aib[x+i])
            {
                i+=x;
                a-=aib[i];
                if(a==0) return i;
            }
        }
        x>>=1;
    }
    return -1;
}
int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    scanf("%d%d",&n,&m);
    while(npow2<=n) npow2=npow2<<1;
    npow2=npow2>>1;
    for(i=1; i<=n; i++)
    {
        scanf("%d",&t);
        update(i,t);
    }
    for(i=1; i<=m; i++)
    {
        scanf("%d",&optiune);
        if(optiune==0)
        {
            scanf("%d%d",&a,&b);
            update(a,b);
        }
        else if(optiune==1)
        {
            scanf("%d%d",&a,&b);
            printf("%d\n",solve1(b)-solve1(a-1));
        }
        else
        {
            scanf("%d",&a);
            printf("%d\n",solve2(a));
        }
    }
}