#include <cstdio>

using namespace std;

int v[100001],n;
long long s[100001];

int zero_terminale(int i)
{
    return (i^(i-1))&i;
}

void add(int p,int x)
{
    for(int i=p; i<=n; i+=zero_terminale(i))
        s[i]+=x;
}

long long sum(int p)
{
    long long rez=0LL;
    for(int i=p; i>0; i-=zero_terminale(i))
        rez+=s[i];
    return rez;
}

int main()
{
    long long q,i,a,b,pas,k,m;
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    scanf("%lld%lld",&n,&m);
    for(i=1; i<=n; i++)
    {
        scanf("%lld",&v[i]);
        add(i,v[i]);
    }
    while(m--)
    {
        scanf("%lld",&q);
        switch(q)
        {
            case 0: scanf("%lld%lld",&a,&b);
                    add(a,b);
                    break;
            case 1: scanf("%lld%lld",&a,&b);
                    printf("%lld\n",sum(b)-sum(a-1));
                    break;
            default:
                scanf("%lld",&a);
                pas=1<<16;
                k=0;
                while(pas)
                {
                    if(pas+k<=n && sum(pas+k)<=a)
                        k+=pas;
                    pas/=2;
                }
                if(sum(k)==a && a)
                    printf("%lld\n",k);
                else
                    printf("-1\n");
        }
    }

    return 0;
}