#include <fstream>

using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

const int NMAX=100010;
int n,m;
int v[NMAX], s[NMAX], aib[NMAX];

void citire()
{
    fin>>n>>m;
    for (int i=1; i<=n; i++){
        fin>>v[i];
        s[i]=s[i-1]+v[i];
    }
}
inline int ultimulBit(int x)
{
    return x&(~(x-1));
}
inline int suma(int i, int j)
{
    return s[j]-s[i-1];
}
void construireAIB()
{
    for (int i=1; i<=n; i++)
        aib[i]=suma(i-ultimulBit(i)+1,i);
}
void update(int a, int b)
{
    v[a]+=b;
    int i=a;
    while (i<=n){
        aib[i]+=b;
        i+=ultimulBit(i);
    }
}
int query(int x)
{
    int sum=0;
    while (x>0){
        sum+=aib[x];
        x-=ultimulBit(x);
    }
    return sum;
}
int tipul2(int a)
{
    int st=1, dr=n;
    int mij=(st+dr)/2;
    int q;
    while (st<=dr){
        q=query(mij);
        if (q<a){
            st=mij+1;
        }else if (q>a){
            dr=mij-1;
        }else{
            return mij;
        }
        mij=(st+dr)/2;
    }
    if (st>dr)
        return -1;
}
void rezolvare()
{
    int a,b,c;
    for (int i=1; i<=m; i++){
        fin>>c>>a;
        if (c<2)
            fin>>b;
        switch (c){
            case 0:
                update(a,b);
                break;
            case 1:
                fout<<query(b)-query(a-1)<<'\n';
                break;
            case 2:
                fout<<tipul2(a)<<'\n';
                break;
        }
    }
}
int main()
{
    citire();
    construireAIB();
    rezolvare();
    fin.close();
    fout.close();
    return 0;
}