#include <fstream>

using namespace std;

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

const int L = 16;
const int N = 100001;
const int M = 150001;

int n, m, v[N], aib[N], op, a, b;

int interogare(int p)
{
    int s = 0;
    while(p != 0)
    {
        s += aib[p];
        p -= (p & (-p));
    }
    return s;
}

void actualizare(int p, int val)
{
    do{
        aib[p] += val;
        p += (p&(-p));
    }while(p <= n);
}

int caut(int val)
{
    if(aib[1] > val)
        return -1;
    int p = 0;
    int pas = 1<<L;
    while(pas != 0)
    {
        if(p + pas <= n && aib[p+pas] <= val)
        {
            p += pas;
            val -= aib[p];
        }
        pas /= 2;
    }
    if(val > 0)
        return -1;
    return p;
}

int main()
{
    in>>n>>m;
    for(int i=1; i<=n; i++)
    {
        in>>a;
        v[i] = a;
        actualizare(i, a);
    }
    for(int i=1; i<=m; i++)
    {
        in>>op;
        if(op == 0)
        {
            in>>a>>b;
            actualizare(a, b);
        }
        if(op == 1)
        {
            in>>a>>b;
            out<< (interogare(b) - interogare(a-1))<<'\n';
        }
        if(op == 2)
        {
            in>>a;
            out<<caut(a)<<'\n';
        }
    }
    return 0;
}