#include <bits/stdc++.h>
#define bit(x) (-x)&x
using namespace std;
ifstream in("aib.in");
ofstream out("aib.out");
vector<int> aib;
int n,p;
void update(int pos,int x)
{
    for(int i=pos;i<=n;i+=bit(i))
        aib[i]+=x;
}
int qsum(int pos)
{
    int sum=0;
    for(int i=pos;i>0;i-=bit(i))
        sum+=aib[i];
    return sum;
}
int query(int x)
{
    int pos=0,y=x;
    for(int i=p;i>0;i/=2)
    if(pos+i<n && aib[i+pos]<x)
    {
        x-=aib[i+pos];
        pos+=i;
    }
    return (qsum(pos+1)==y ? pos+1 : -1);
}
int main()
{
    int m,pos,x,y,t;
    in>>n>>m;
    aib=vector<int>(n+1);
    for(p=1;p<=n;p*=2);
    for(int i=1;i<=n;i++)
    {
        in>>x;
        update(i,x);
    }
    for(;m;m--)
    {
        in>>t;
        if(t==0)
        {
            in>>pos>>x;
            update(pos,x);
        }
        else if(t==1)
        {
            in>>x>>y;
            out<<qsum(y)-qsum(x-1)<<'\n';
        }
        else{
            in>>x;
            out<<query(x)<<'\n';
        }
    }
    return 0;
}