#include <cstdio>

using namespace std;

long long aib[200005],n,L=16;

long long query(long long x)
{
    long long s=0;
    while(x!=0)
    {
        s+=aib[x];
        x-=(x&(-x));
    }
    return s;
}

long long update(long long x, long long val)
{
    long long p;
    while(x<=n)
    {
        aib[x]+=val;
        x+=(x&(-x));
    }
}

long long caut(long long k)
{
    long long i=0,pas=1<<L;
    while(pas!=0)
    {
        if(query(i+pas)<=k&&i+pas<=n)
        {
            //k-=aib[i+pas];
            i+=pas;
        }
    pas/=2;
    }
    if(query(i)==k)
        return i;
    else
        return -1;
}

int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    long long q,p,a,b,x;

    scanf("%lld %lld",&n,&q);
    for(long long i=1;i<=n;++i)
    {
        scanf("%lld",&x);
        update(i,x);
    }

    for(long long i=1;i<=q;++i)
    {
        scanf("%lld",&p);
        if(p==0)
        {
            scanf("%lld %lld",&a,&b);
            update(a,b);
        }
        else
        if(p==1)
        {
            scanf("%lld %lld",&a,&b);
            b=query(b);
            --a;
            a=query(a);
            printf("%lld\n",b-a);
        }
        else
        {
            scanf("%lld",&a);
            printf("%lld\n",caut(a));
        }
    }

    return 0;
}