#include<cstdio>
using namespace std;

#define Nmax 100005

int aib[Nmax],n,m;
void update(int x,unsigned int poz)
{
    int lsb;
    while(poz<=n){
        aib[poz]+=x;
        lsb=poz&(-poz);
        poz+=lsb;
    }
}
int query(int x)
{
    int s=0,lsb;
    while(x)
    {
        s+=aib[x];
        lsb=x&(-x);
        x-=lsb;
    }
    return s;
}
int bs(int x)
{
    int p=1,u=n,mij,s;
    while(p<=u)
    {
        mij=(p+u)/2;
        s=query(mij);
        if(x<s)
            u=mij-1;
        else
            if(x>s) p=mij+1;
            else return mij;
    }
    return -1;
}
int main()
{
    int x,a,b, op;
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);

    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        update(x,i);
    }
    while(m)
    {
        m--;
        scanf("%d",&op);
        switch(op)
        {
            case 0:
                    scanf("%d %d",&a,&b);
                    update(b,a);
                    break;
            case 1: scanf("%d %d",&a,&b);
                    printf("%d\n",query(b)-query(a-1));
                    break;
            case 2: scanf("%d",&a);
                    printf("%d\n",bs(a));
                    break;
        }
    }
    return 0;
}