#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 Sum)
{
    int pos = N+1, B;
    int limst=0, limdr=N+1;

    B = N;
    int S = Query(B);

    if ( S == Sum ) pos = N;

    while ( B )
    {
          B = (limst+limdr)>>1;
          S = Query(B);

          if ( S > Sum )
          {
               if ( limdr > B ) limdr = B;
               B -= 1;
          }
          else if ( S == Sum ) pos = min(pos,B), limdr = B, B -= 1;
          else
          {
              if ( limst < B ) limst = B;
              B += 1;
          }

          if ( B <= limst ) break;
          if ( B >= limdr ) break;
    }

    if ( pos == N+1 ) return -1;
    return pos;
}