#include<cstdio>
using namespace std;
int n,m,i,x,k,arb[(1<<17)+5],op,a,b;
int lsb(int x)
{
    return x&(-x);
}
void add(int poz, int val)
{
    for(int i=poz;i<=k;i+=lsb(i)) arb[i]+=val;
}
int sum(int x)
{
    int sol=0,i;
    for(i=x;i;i-=lsb(i)) sol+=arb[i];
    return sol;
}
int query(int val)
{
    int step,sol=0,poz=0;
    for(step=k;step;step>>=1)
        if(sol+arb[poz+step]<val)
        {
            sol+=arb[poz+step];
            poz+=step;
        }
    if(sum(poz+1)==val) return poz+1;
    return -1;
}
int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    scanf("%d%d",&n,&m);
    k=1<<17;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        add(i,x);
    }
    for(;m;m--)
    {
        scanf("%d",&op);
        if(op==0)
        {
            scanf("%d%d",&a,&b);
            add(a,b);
            continue;
        }
        if(op==1)
        {
            scanf("%d%d",&a,&b);
            printf("%d\n",sum(b)-sum(a-1));
            continue;
        }
        if(op==2)
        {
            scanf("%d",&x);
            printf("%d\n",query(x));
        }
    }
    return 0;
}