#include <bits/stdc++.h>

using namespace std;

int v[150005], aib[150005], n;

int lsb(int val)
{
    int k;
    k=val&(-val);
    return k;
}

void update(int nod, int val)
{
    do
    {
        aib[nod]+=val;
        nod+=lsb(nod);

    }while(nod<=n);

}

int querry1(int start, int finish)
{
    int k2 = finish;
    int sum=0;
    do
    {

        sum+=aib[k2];
        k2-=lsb(k2);

    }while(k2>0);

    int k1=start-1;

    do
    {

        sum-=aib[k1];
        k1-=lsb(k1);

    }while(k1>0);

    return sum;
}

int querry2(int val)
{

    int bitu = 1;
    while(bitu <= n)
    {
        bitu<<=1;
    }
    bitu>>=1;
    int sum=0, st = 0, last = 0;
    while(bitu)
    {

        if(sum+aib[bitu+st]>=val)
        {
            if(sum+aib[bitu+st]==val)
            {
                last=bitu+st;
            }
        }
        else
        {
            sum+=aib[bitu+st];
            st+=bitu;
        }
        bitu>>=1;
    }
    return last;
}

int main()
{
    ifstream cin("aib.in");
    ofstream cout("aib.out");
    int m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];
        update(i,v[i]);
    }
    int t,a,b;
    for(int i=1;i<=m;i++)
    {
        cin>>t;
        if(t==0)
        {
            cin>>a>>b;
            update(a,b);
        }
        else
        {
            if(t==1)
            {
                cin>>a>>b;
                cout<<querry1(a,b)<<"\n";
            }
            else
            {
                cin>>a;
                cout<<querry2(a)<<"\n";
            }
        }
    }
    return 0;
}