#include <fstream>
#define int long long
#define inf 1e18
#define nmax (int)(1e5+2)
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");
int aib[nmax],n,m,x,y,tip;
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;
}
signed main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>x;
        update(i,x);
    }
    while(m--){
        cin>>tip>>x;
        if(tip==2){
            int st=1,dr=n,poz=-1;
            while(st<=dr){
                int mid=(st+dr)/2,ans=query(mid);
                if(ans>=x){
                    if(ans==x)
                        poz=mid;
                    dr=mid-1;
                }else
                    st=mid+1;
            }
            cout<<poz<<'\n';
            continue;
        }
        cin>>y;
        if(tip==0)
            update(x,y);
        else
            cout<<query(y)-query(x-1)<<'\n';
    }
    return 0;
}