#include <iostream>
#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");

int n,m,aib[100032];
#define zeros(x) ( (x ^ (x - 1)) & x )

void build()
{
   for(int i = 1 ; i <= n ; i++)
       if( i+zeros(i) <= n )
       aib[i+zeros(i)] += aib[i];
}

void Add(int x,int quantity)
{
    for(int i = x ; i <= n ; i += zeros(i) )
        aib[i] += quantity;
}

int Compute(int x)
{
    int ret = 0;
    for(int i = x ; i > 0 ; i -= zeros(i) )
        ret += aib[i];
    return ret;
}

int BinarySearch(int x)
{
    int j,step;
    for(step = 1 ; step <= n ; step <<= 1);
    for( j = 0 ; step ; step >>= 1)
        if( j+step <= n && aib[j+step] <= x )
        {
            j += step;
            x -= aib[j];
            if( x == 0 ) return j;
        }

    return -1;
}

int main()
{
    int q,a,b;
    f>>n>>m;
    for(int i = 1 ; i <= n ; ++i)
        f>>aib[i];
    build(); // O(n)
    for(int i = 1 ; i <= m ; ++i)
    {
       f>>q;
       switch(q)
       {
        case 0 : f>>a>>b; Add(a,b); break;
        case 1 : f>>a>>b; g<<Compute(b)-Compute(a-1)<<'\n'; break;
        case 2 : f>>a; g<<BinarySearch(a)<<'\n'; break;
       }
    }
    return 0;
}