#include <stdio.h>
#include <fstream>
using namespace std;

#define in "aib.in"
#define out "aib.out"
#define dim 100001

inline int Minim(int a, int b) {
       if ( a < b ) return a;
       return b;
}

int N, M, T;
int Arb[dim];
int C, S;

void Update(int,int);
int Query(int);
int Search(int);

int main()
{
    int K, X, Y;

    freopen(in,"r",stdin);
    freopen(out,"w",stdout);

    scanf("%d%d", &N, &M);
    for ( int i = 1; i <= N; i++ )
    {
        scanf("%d", &T);
        Update(i,T);
    }

    for ( ; M; M-- )
    {
        scanf("%d", &K);

        if ( K < 2 )
        {
             scanf("%d%d", &X, &Y);
             if ( !K ) Update(X,Y);
             else      printf("%d\n", Query(Y)-Query(X-1));
        }
        else
        {
            scanf("%d", &X);

            printf("%d\n", Search(X));
        }
    }
}

int Search(int S) {
    int left=0,right=N+1;
    while (left<=right) {
        int mij=((left+right)>>1);
        int val=Query(mij);
        if (S>val) {
            left=mij+1;
        }
        else if (S==val) {
            return mij;
        }
        else {
            right=mij-1;
        }
    }
    return -1;
}

void Update(int poz, int val)
{
     C = 0;
     while ( poz <= N )
     {
           Arb[poz] += val;
           while ( !(poz & (1<<C)) ) C++;
           poz += (1<<C);
           C += 1;
     }
}

int Query(int poz)
{
    C = 0, S = 0;
    while ( poz > 0 )
    {
          S += Arb[poz];
          while ( !(poz & (1<<C)) ) C++;
          poz -= (1<<C);
          C += 1;
    }

    return S;
}

/*#include<iostream>
#include<fstream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<bitset>
#include<cstring>
#include<queue>

#define ull unsigned long long
#define ll long long
#define pb push_back
#define FOR(a,b,c) for (int a=b;a<=c; ++a)
#define ROF(a,b,c) for (int a=b;a>=c; --a)

using namespace std;
int N,M;
int aib[100010];

void Update(int,int);
int Query(int);
int Search(int);

int main()
{
    FILE *f,*g;
    f=fopen("aib.in","r");
    g=fopen("aib.out","w");
    fscanf(f,"%i%i",&N,&M);
    FOR (i,1,N) {
        int x;
        fscanf(f,"%i",&x);
        Update(i,x);
    }
    FOR (i,1,M) {
        int tip;
        fscanf(f,"%i",&tip);
        if (tip==2) {
            int x;
            fscanf(f,"%i",&x);
            fprintf(g,"%i\n",Search(x));
        }
        else {
            int x,y;
            fscanf(f,"%i%i",&x,&y);
            if (tip==1) {
                fprintf(g,"%i\n",Query(y)-Query(x-1));
            }
            else {
                Update(x,y);
            }
        }
    }
    fclose(f);fclose(g);
    return 0;
}

void Update(int poz,int val) {
    int C=0;
    while (poz<=N) {
        aib[poz]+=val;
        while (!(poz&(1<<C))) {
            ++C;
        }
        poz+=(1<<C);
        ++C;
    }
}

int Query(int poz) {
    int S=0,C=0;
    while (poz) {
        S+=aib[poz];
        while (!(poz&(1<<C))) {
            ++C;
        }
        poz-=(1<<C);
        ++C;
    }
    return S;
}

int Search(int S) {
    int left=0,right=N+1;
    while (left<=right) {
        int mij=((left+right)>>1);
        int val=Query(mij);
        if (S>val) {
            left=mij+1;
        }
        else if (S==val) {
            return mij;
        }
        else {
            right=mij-1;
        }
    }
    return -1;
}
*/