#include <bits/stdc++.h>
#define NMAX 100000

using namespace std;

ifstream f("aib.in");
ofstream g("aib.out");

int n, m, aib[4 * NMAX + 5], task;
int poz, val;

void Update(int node, int left, int right)
{
    if(left == right)
    {
        aib[node] += val;
        return;
    }
    int mid = (right + left) / 2;
    if(poz <= mid)
        Update(2 * node, left, mid);
    else
        Update(2 * node + 1, mid + 1, right);
    aib[node] = aib[2 * node] + aib[2 * node + 1];
}

int Query(int node, int left, int right, int st, int dr)
{
    if(st <= left && right <= dr)
        return aib[node];
    int mid = (left + right) / 2, r1(0), r2(0);
    if(st <= mid)
        r1 = Query(2 * node, left, mid, st, dr);
    if(dr > mid)
        r2 = Query(2 * node + 1, mid + 1, right, st, dr);
    return r1 + r2;
}

int cb(int sum)
{
    int st = 1, dr = n;
    int rez = -1;
    while(st <= dr)
    {
        int mid = (st + dr) / 2;
        int x = Query(1, 1, n, 1, mid);
        if(x < sum)
            st = mid + 1;
        else if(x > sum)
            dr = mid - 1;
        else
        {
            rez = mid;
            dr = mid - 1;
        }
    }
    return rez;
}


int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        f >> val;
        poz = i;
        Update(1, 1, n);
    }

    for(; m; m--)
    {
        f >> task;
        if(task == 0)
        {
            f >> poz >> val;
            Update(1, 1, n);
        }
        if(task == 1)
        {
            int x, y;
            f >> x >> y;
            g << Query(1, 1, n, x, y) << "\n";
        }
        if(task == 2)
        {
            f >> val;
            g << cb(val) << "\n";
        }
    }
    return 0;
}