#include <cstdio>
using namespace std;
int n,v[100001],m;
void adauga(int val, int poz)
{
    int p=0;
    while(poz<=n)
    {
        v[poz]+=val;
        while(!(poz&(1<<p)))
            ++p;
        poz+=(1<<p);
        ++p;
    }
}
int sum(int st, int dr)
{
    int p=0;
    int s1=0,s2=0;
    while(dr>0)
    {
        s1+=v[dr];
        while(!(dr&(1<<p)))
            ++p;
        dr-=(1<<p);
        ++p;
    }
    st--;
    p=0;
    while(st>0)
    {
        s2+=v[st];
        while(!(st&(1<<p)))
            ++p;
        st-=(1<<p);
        ++p;
    }
    return s1-s2;
}
int ret_k(int s)
{
    int pas,i;
    for(pas=1;pas<=n;pas<<=1);
    for(i=0;pas;pas>>=1)
    {
        if(i+pas<=n&&v[i+pas]<=s){
            s-=v[i+pas];
            i+=pas;}
    }
    if(s==0)
    return i;
    return -1;
}
void solve()
{
    int a,b,c;
    for(int i=1;i<=m;++i)
    {
        scanf("%d",&a);
        switch(a)
        {
            case 0:
                scanf("%d%d",&b,&c);
                adauga(c,b);
                break;
            case 1:
                scanf("%d%d",&b,&c);
                printf("%d\n",sum(b,c));
                break;
            case 2:
                scanf("%d",&b);
                printf("%d\n",ret_k(b));
                break;
        };
    }
}
void citire()
{
    scanf("%d%d",&n,&m);
    int a;
    for(int i=1;i<=n;++i){
        scanf("%d",&a);
        adauga(a,i);}
}
int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    citire();
    solve();
    fclose(stdin);
    fclose(stdout);
    return 0;
}