#include <iostream>
#include <fstream>
#include <vector>
#include <stdio.h>
#include <algorithm>
#define dim 100001
#define For(i,a,b) for (int i=(a);i<=(b);++i)
using namespace std;
int N, M, T;
int Arb[dim];
int C, S;
inline int Minim(int a, int b) {
       if ( a < b ) return a;
       return b;
}
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 >= Arb[i+step] )
            {
                i += step, val -= Arb[i];
                if ( !val ) return i;
            }
         }
    }

    return -1;
}

void Update(int poz, int val)
{
     C = 0;
     while ( poz <= N )
     {
           Arb[poz] += val;
           while ( !(poz & (1<<C)) ) C++;
           poz += (1<<C);
           C += 1;
     }
}

int Query(int poz)
{
    C = 0, S = 0;
    while ( poz > 0 )
    {
          S += Arb[poz];
          while ( !(poz & (1<<C)) ) C++;
          poz -= (1<<C);
          C += 1;
    }

    return S;
}
int main()
{
    ifstream in("aib.in");
    ofstream out("aib.out");
    in >>N>>M;
    For(i,1,dim) Arb[i]=0;
    int K, X, Y;
    For(i,1,N)
    {
        in >>T;
        Update(i,T);
    }
    for (;M;M--)
    {
        in >>K;
        if (K<2)
        {
            in >>X>>Y;
            if (!K) Update(X,Y);
            else out<<Query(Y)-Query(X-1)<<"\n";
        }
        else
        {
            in>>X;
            out<<Search(X)<<"\n";
        }
    }
    return 0;
}