#include<cstdio>
#define NMAX 100002
using namespace std;

int aib[NMAX], n, m;

inline void Update(int val, int x)
{
    while(x <= n)
    {
        aib[x] += val;
        x += x & -x;
    }
}

inline int suma(int x)
{
    int s = 0;
    while(x)
    {
        s += aib[x];
        x &= x - 1;
    }
    return s;
}

int Bsearch(int val)
{
    int st, dr, mij, sum;
    st = 1; dr = n;
    while(st <= dr)
    {
        mij = st + ((dr-st) >> 1);
        sum = suma(mij);
        if(sum == val) return mij;
        else
            if(val < sum)
                dr = mij - 1;
            else st = mij+1;
    }
    return -1;
}

int main()
{
    int x, nr, a, b;
    FILE *fin, *fout;
    fin = fopen("aib.in","r");
    fout = fopen("aib.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(int i=1; i<=n; i++)
    {
        fscanf(fin,"%d",&x);
        Update(x,i);
    }
    for(int i=1; i<=m; i++)
    {
        fscanf(fin,"%d",&nr);
        if(!nr)
        {
            fscanf(fin,"%d%d",&a,&b);
            Update(b,a);
        }
        else
            if(nr == 1)
            {
                fscanf(fin,"%d%d",&a,&b);
                fprintf(fout,"%d\n",suma(b) - suma(a-1));
            }
            else
            {
                fscanf(fin,"%d",&a);
                fprintf(fout,"%d\n",Bsearch(a));
            }
    }
    fclose(fin);
    fclose(fout);
    return 0;
}