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

using namespace std;

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

int n, m, aib[NMAX + 4], task;

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

int Query(int poz)
{
    int rez = 0;
    for(int i = poz; i >= 1; i -= (i & -i))
        rez += aib[i];
    return rez;
}

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


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

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