#include <iostream>
#include <fstream>
using namespace std;
#define zeros(i) (i ^ (i-1)) & i
ifstream ka("aib.in");
ofstream ki("aib.out");

const int N_MAX = 100000;
int aib[N_MAX + 1];
int n, m, x, y;

void update(int t, int val)
{
    for(int i = t; i <= n; i += zeros(i))
        aib[i] += val;
}

int compute(int t)
{
    int s = 0;
    for(int i = t; i > 0; i -= zeros(i))
        s += aib[i];
    return s;
}

int caut_bin(int t)
{
    int original = t;
    int step = 1;
    for(; (1 << step) < n; step++);

    int i = 0;

    for(int k = step; k >= 0; k--)
        if((i + (1 << k) <= n) && aib[i + (1 << k)] < t)
        {
            t -= aib[i + (1 << k)];
            i += (1 << k);
        }
    if(compute(i + 1) == original)
        return i + 1;
    else
        return -1;
}

int main()
{
    ka >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        ka >> x;
        update(i, x);
    }
    for(int i = 1; i <= m; i++)
    {
        ka >> x;
        if(x == 2)
        {
            ka >> y;
            ki << caut_bin(y)<< '\n';
        }
        else
        {
            int a, b;
            ka >> a >> b;
            if(x == 0)
                update(a, b);
            else
                ki << compute(b) - compute(a - 1) << '\n';
        }
    }
}