#include <bits/stdc++.h>
using namespace std;

ifstream in("aib.in");
ofstream out("aib.out");
int aib[100005], n, a[100005];

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

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

int CautBin(int k)
{
    int st, dr, mij, x;
    st = 1;
    dr = n;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        x = Query(mij);
        if (x == k) return mij;
        if (x < k) st = mij + 1;
        else dr = mij - 1;
    }
    return -1;
}

int main()
{
    int op, x, y, i, Q;
    in >> n >> Q;
    for(i = 1; i <= n; i++)
    {
        in >> a[i];
        Update(i, a[i]);
    }
    for (i = 1; i <= Q; i++)
    {
        in >> op;
        if (op == 0)
        {
            in >> x >> y;
            Update(x, y);
        }
        else if(op == 1)
        {
            in >> x >> y;
            out << Query(y) - Query(x - 1)<<"\n";
        }
        else
        {
            in >> x;
            out << CautBin(x) << "\n";
        }
    }
    return 0;
}