/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod  1999999973LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 100100
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
int A[N],n,m,p,x,t;
void upd(int p,int x)
{
    for(;p<=n;p+=p&-p)
        A[p]+=x;
}
int sum(int p)
{
    int sum=0;
    for(;p;p-=p&-p)
        sum+=A[p];
    return sum;
}
int find(int p)
{
    int po=1;
    for(;po<=n;po<<=1);
    po>>=1;
    int sol=0;
    int cs=0;
    for(;po;po>>=1)
    if(sol+po<=n&&cs+A[sol+po]<=p)
    {
        cs+=A[sol+po];
        sol+=po;
    }
    if(cs==p)
    return sol;
    else
    return -1;
}
int main ()
{
    f>>n>>m;
    FOR(i,1,n)
    {
        f>>x;
        upd(i,x);
    }
    FOR(i,1,m)
    {
        f>>t;
        if(!t)
        {
            f>>p>>x;
            upd(p,x);
        }
        else
        if(t==1)
        {
            f>>p;
            g<<sum(p)<<"\n";
        }
        else
        {
            f>>p;
            g<<find(p)<<"\n";
        }
    }
    return 0;
}