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

const int nMax = 100005;

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

int aib[nMax];
int n, Q;

void Update(int p, int val)
{
    for (int i = p; i <= n; i += i & (-i))
        aib[i] += val;
}

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

int CautBin(int S)
{
    int st, dr, m, Suma;
    int p = -1;
    st = 1;
    dr = n;
    while(st <= dr)
    {
        m = (st + dr) / 2;
        Suma = Query(m);
        if (Suma == S)
        {
            p = m;
            dr = m - 1;
        }
        if (Suma > S)
            dr = m - 1;
        if (Suma < S)
            st = m + 1;
    }
    return p;
}

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

    while(Q--)
    {
        fin >> op;
        if (op == 0)
        {
            fin >> x >> y;
            Update(x, y);
        }
        else if (op == 1)
        {
            fin >> x >> y;
            fout << Query(y) - Query(x - 1) << "\n";
        }
        else
        {
            fin >> x;
            fout << CautBin(x) << "\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}