#include <fstream>
#include <cstdio>
#define maxN 100001
using namespace std;
//ifstream f("aib.in");
//ofstream g("aib.out");
FILE *f,*g;
int n,m,c[maxN],i,x,a,y,z;
void modify(int poz,int x)
{
    int k=0;//nr de 0 terminale in repr binar
    while(poz<=n)
    {
        c[poz]+=x;
        while(!(poz & (1<<k)))
           k++;
        poz+=(1<<k);
        k++;
    }
}
int sum(int p) //suma subsecv 1..p
{
    int s=0,k=0;
    while(p)
    {
        s+=c[p];
        while(!(p & (1<<k)))
           k++;
        p-=(1<<k);
        k++;
    }
    return s;
}
int search(int x)
{
    int k,i;
    for(k=0;k<n;k=(1<<k));
    for(i=0;k;k=(k>>1))
    {
        if(i+k<=n)
        {
            if(x>=c[i+k])
            {
                i+=k;
                x-=c[i];
                if(!x)
                    return i;
            }
        }
    }
    return -1;
}
void citire()
{
    f=freopen("aib.in","r",stdin);
    g=freopen("aib.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        modify(i,x);
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d",&x);
        if(x==0)
        {
            scanf("%d%d",&y,&z);
            modify(y,z);
        }
        else
            if(x==1)
            {
                scanf("%d%d",&y,&z);
                unsigned sum1,sum2;
                sum1=sum(z);
                sum2=sum(y-1);
                printf("%d\n",sum1-sum2);
            }
            else
            {
                scanf("%d",&a);
                printf("%d\n",search(a));
            }
    }
    fclose(f);
    fclose(g);
}
int main()
{
    citire();
    return 0;
}