#include <bits/stdc++.h>

using namespace std;

int n, aib[100005], m;

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

void Update(int poz, int x)
{
    while(poz <= n)
    {
        aib[poz] += x;
        ///aflul cati biti de 0 sunt la finalul lui p
        /**int i = 1;
        while(p % (i * 2) == 0)
            i = i * 2;
        p = p + i;
        sau*/
        poz += (poz & (-poz));
    }
}
///suma de la a[1] la a[poz]
int Suma(int poz)
{
    int s = 0;
    while(poz > 0)
    {
        s += aib[poz];
        poz -= (poz & (-poz));
    }
    return s;
}

///cauta cea mai din st pozitie poz cu suma a[1] + .. + a[poz] = s;
int CautBin(int poz, int s)
{
    int st, dr, p, mij, suma;
    st = 1; dr = poz; p = -1;
    {
        while(st <= dr)
        {
            mij = (st + dr) / 2;
            suma = Suma(mij);
            if(suma == s)
            {
                p = mij;
                dr = mij - 1;
            }
            else if(suma > s) dr = mij - 1;
            else st = mij + 1;
        }
    }
    return p;
}

int main()
{
    int i, x, op, a, b;
    fin >> n >> m;
    for(i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i, x);
    }
    while(m--)
    {
        fin >> op;
        if(op == 0)
        {
            fin >> a >> b;
            Update(a, b);
        }
        else if(op == 1)
        {
            fin >> a >> b;
            fout << Suma(b) - Suma(a - 1) << "\n";
        }
        else
        {
            fin >> a;
            fout << CautBin(n, a) << "\n";
        }
    }
    return 0;
}