#include <fstream>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
int n,m,task,x,y,aib[nmax];
void update(int p,int x){
    for(;p<=n;p+=(-p)&p)
        aib[p]+=x;
}
int query(int p){
    int r=0;
    for(;p>0;p-=(-p)&p)
        r+=aib[p];
    return r;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>x;
        update(i,x);
    }
    while(m--){
        cin>>task>>x;
        if(task==2){
            int st=1,dr=n,p=-1;
            while(st<=dr){
                int mid=(st+dr)/2,k=query(mid);
                if(k==x)
                    p=mid,dr=mid-1;
                else if(k>x)
                    dr=mid-1;
                else
                    st=mid+1;
            }
            cout<<p<<'\n';
            continue;
        }
        cin>>y;
        if(task==0)
            update(x,y);
        else
            cout<<query(y)-query(x-1)<<'\n';
    }
    return 0;
}