#include <bits/stdc++.h>

using namespace std;

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

const int Nmax = 1e5 + 5;

int n, m;
int aib[Nmax];

void Update(int s, int p)
{
    while(p <= n)
    {
        aib[p] += s;
        p += (p & (-p));
    }
}

int Query(int p)
{
    int s = 0;

    while(p)
    {
        s += aib[p];
        p -= (p & (-p));
    }

    return s;
}

int Caut_bin(int x)
{
    int st, dr, mij, v, p = -1;

    st = 1; dr = n;

    while(st <= dr)
    {
        mij = (st + dr) / 2;

        v = Query(mij);
        if(v >= x)
        {
            p = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }

    return p;
}

int main()
{
    fin >> n >> m;

    int x, y, op;
    for(int i = 1; i <= n; i++)
    {
        fin >> x;
        Update(x, i);
    }


    for(int i = 1; i <= m; i++)
    {
        fin >> op;

        if(op == 0)
        {
            fin >> x >> y;
            Update(y, x);
        }
        else if(op == 1)
        {
            fin >> x >> y;
            fout << Query(y) - Query(x - 1) << "\n";
        }
        else
        {
            fin >> x;
            fout << Caut_bin(x) << "\n";
        }
    }

    fin.close();
    fout.close();
    return 0;
}