#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream cin("aib.in");
ofstream cout("aib.out");

long long n, m, x, y, c, aib[100002], C,ok;

#define zeros(x)((x^(x-1))&x)

void update(int a, int q)
{
    for(int i=a;i<=n;i+=zeros(i))
        aib[i]+=q;
}

int sum(int x)
{
    int s=0;
    for(int i=x;i>0;i-=zeros(i))

        s+=aib[i];
    return s;
}

int Search(int val)
{
    int i, step;

    for ( step = 1; step < n; step <<= 1 );

    for( i = 0; step; step >>= 1 )
    {
         if( i + step <= n)
         {
            if( val >= aib[i+step] )
            {
                i += step, val -= aib[i];
                if ( !val ) return i;
            }
         }
    }

    return -1;
}


int main()
{
    cin>>n>>m;
    for(int i=1; i<=n;i++)
    {
        cin>>x;
        update(i,x);
    }
    for(int i=1;i<=m;i++)
    {
        cin>>c;
        if(c==0)
        {
            cin>>x>>y;
            update(x,y);
        }
        else if(c==1)
        {
            cin>>x>>y;
            cout<<sum(y)-sum(x-1)<<'\n';
        }
        else{
            cin>>x;
            cout<<Search(x)<<'\n';
        }
    }
}