#include <bits/stdc++.h>

using namespace std;

ifstream in ("segtree.in");
ofstream out ("segtree.out");

int n, m, v[200005];

void citire()
{
    in >> n >> m;
    for (int i=0; i<n; i++)
        in >> v[n+i];
}

void build()
{
    for (int i=n-1; i; i--)
        v[i]=v[i<<1]+v[i<<1|1];
}

void modify(int p, int value)
{
    p+=n;
    for (v[p]+=value; p>1; p>>=1)
        v[p>>1]=v[p]+v[p^1];
}

int query(int l, int r)
{
    int s=0;
    for (l+=n, r+=n; l<r; l>>=1, r>>=1)
    {
        if (l&1)
            s+=v[l++];
        if (r&1)
            s+=v[--r];
    }
    return s;
}

int binarysearch(int s)
{
    int rez;
    int st=0, dr=n, mij;
    while (st<=dr)
    {
        mij=st+(dr-st)/2;
        rez=query(0,mij);
        if (rez==s)
            return mij;
        else
            if (rez<s)
                st++;
            else
                dr--;
    }
    return -1;
}

void op()
{
    int p, x, y;
    for (int i=1; i<=m; i++)
    {
        in >> p;
        if (p==0)
        {
            in >> x >> y;
            modify(x-1,y);
        }
        else
            if (p==1)
            {
                in >> x >> y;
                out << query(x-1,y) << '\n';
            }
            else
            {
                in >> x;
                out << binarysearch(x) << '\n';
            }
    }
}

void afis()
{
    for (int i=n; i<2*n; i++)
        out << v[i] << " ";
}

int main()
{
    citire();
    build();
    op();
    //afis();
    return 0;
}