#include <fstream>

using namespace std;

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

int n, t, aib[100005], op, x, y;

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

int Query1 (int p) /// a[1] + a[2] + ... a[p]
{
    int s;
    for (s = 0; p > 0; p -= (p & -p))
        s += aib[p];
    return s;
}

int Query2 (int x)
{
    int left, right, mid, pos;
    left = 1;
    right = n;
    pos = -1;
    while (left <= right)
    {
        mid = (left + right) / 2;
        if (x == Query1(mid))
        {
            pos = mid;
            right = mid -1;
        }
        else if (x > Query1(mid))
            left = mid + 1;
        else right = mid - 1;
    }
    return pos;
}

void Solve ()
{
    int i;
    fin >> n >> t;
    for (i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i, x);
    }
    for (i = 1; i <= t; i++)
    {
        fin >> op;
        if (op == 0)
        {
            fin >> x >> y;
            Update(x, y);
        }
        else if (op == 1)
        {
            fin >> x >> y;
            fout << Query1(y) - Query1(x - 1) << "\n";
        }
        else
        {
            fin >> x;
            fout << Query2(x) << "\n";
        }
    }
    fout.close();
}

int main()
{
    Solve();
    return 0;
}