#include <fstream>

using namespace std;

int a[100005], aib[100005], n, m, t[30005];

void Update(int i, int x)
{
    //int k;
    while (i <= n)
    {
        aib[i] += x;
        //k = 0;
        //while (((i >> k) & 1)==0)
        //    k++;
        //i = i + (1 << k);
        i = i + (i & (-i));
    }
}

int Query(int i)
{
    int s = 0;
    while (i > 0)
    {
        s += aib[i];
        i = i - (i & (-i));
    }
    return s;
}

//cauta cea mai mica pozitie p
// care are suma Query(p) = x
int Cauta(int x)
{
    int sol, st, dr, mij, val;
    st = 1; dr = n; sol = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        val = Query(mij);
        if (val == x)
        {
            sol = mij;
            dr = mij - 1;
        }
        else if (val > x) dr = mij - 1;
        else st = mij + 1;
    }
    return sol;
}

void InitAIB()
{
    int i;
    for (i = 1; i <= n; i++)
        Update(i, a[i]);
}

void Citire()
{
    int i, x, y, op, rez;
    ifstream fin("aib.in");
    ofstream fout("aib.out");
    fin >> n >> m;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    InitAIB();
    for (i = 1; i <= m; i++)
    {
        fin >> op;
        if (op == 0)
        {
            fin >> x >> y;
            Update(x, y);
        }
        else if (op == 1)
        {
            fin >> x >> y;
            rez = Query(y) - Query(x - 1);
            fout << rez << "\n";
        }
        else
        {
            fin >> x;
            rez = Cauta(x);
            fout << rez << "\n";
        }
    }
    fin.close();
    fout.close();
}

int main()
{
    Citire();

    return 0;
}