#include <bits/stdc++.h>

using namespace std;

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

const int lmax = 1e5 + 7;
int v[lmax];
int n, m;

void update(int x, int t)
{
    for (int i = t; i <= n; i += i & (-i))
    {
        v[i] += x;
    }
}

int query(int t)
{
    int s = 0;
    for (int i = t; i > 0; i -= i & (-i))
    {
        s += v[i];
    }

    return s;
}

int BinarySearch(int x)
{
    int l = 1;
    int r = n;
    int ans = -1;

    while (l <= r)
    {
        int mid = (l + r) / 2;
        int sum = query(mid);
        if (sum == x)
            ans = mid;
        if (sum >= x)
            r = mid - 1;
        else
            l = mid + 1;
    }
    return ans;
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x;
        fin >> x;
        update(x, i);
    }

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

        if (operatie == 0 || operatie == 1)
        {
            int a, b;
            fin >> a >> b;

            if (operatie == 0)
                update(b, a);
            else
                fout << query(b) - query(a - 1) << "\n";
        }
        else
        {
            int a;
            fin >> a;
            int ans = BinarySearch(a);
            fout << ans << "\n";
        }
    }
    return 0;
}