// http://www.ginfo.ro/revista/13_1/focus.pdf
// arb[x]= informatie pe intervalul [x-2^bit+1,x]

#include <iostream>
#include <fstream>
using namespace std;
int a[100014],n,m,x,y,val,cod;
// functia actualizare (bitul nesemnificativ)
void update (int poz, int nr)
{
    int bit;
    while (poz>0&&poz<=n)
    {
        a[poz]=a[poz]+nr;
        bit=0;
        while (((1<<bit) & poz )==0)  // 5,5 0101 -> 5,6 0110 -> 1,8 1000
            bit++;
        poz=poz+(1<<bit);
    }
}
int query (int poz)
{
    int bit,s=0;
    while (poz>0 && poz<=n)
    {
        s=s+a[poz];
        bit=0;
        while ((poz & (1<<bit))==0)// procedeul invers
            bit++;
        poz=poz-(1<<bit);
        bit++;
    }
    return s;
}
int search (int val)
{
    int st=1,dr=n,mij;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (query(mij)==val)
            return mij;
        if (query(mij)<val)
            st=mij+1;
        else
            dr=mij-1;
    }
    return -1;
}
int main()
{
    int i,j,nr,poz,aa,b,k;

    FILE *f, *g;
    f=fopen("aib.in","rt");
    g=fopen("aib.out","wt");
    fscanf(f,"%d%d",&n,&m);
    for (i=1;i<=n;i++)
    {
        fscanf(f,"%d",&nr);
        poz=i;
        update(poz,nr);
    }
    for (i=1;i<=m;i++)
    {
        fscanf(f,"%d",&cod);
        if (cod==0)
        {
            fscanf(f,"%d%d",&poz,&nr);
            update(poz,nr);
        }
        if (cod==1)
        {
            fscanf(f,"%d%d",&aa,&b);
            fprintf(g,"%d\n",query(b)-query(aa-1));
        }
        if (cod==2)
        {
           fscanf(f,"%d",&k);
            fprintf(g,"%d\n",search(k));
        }
    }
}