#include <bits/stdc++.h>
using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

const int MAXN = 100205;
int n,q,aib[MAXN];

void update(int pos, int val)
{
    while (pos<=n)
    {
        aib[pos]+=val;
        pos+=pos&-pos;
    }
}

int query(int x)
{
    int sum=0;
    while(x>0)
    {
        sum+=aib[x];
        x-=x&-x;
    }
    return sum;
}

int cautbin(int k)
{
    if(query(n)<k)
        return -1;
    int st=1,dr=n,sol=-1;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        int suma=query(mid);
        if(suma>=k)
        {
            sol=mid;
            dr=mid-1;
        }
        else
        {
            st=mid+1;
        }
    }
    return sol;
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);
    fin>>n>>q;
    for(int i=1,x;i<=n;i++)
    {
        fin>>x;
        update(i,x);
    }
    for(int i=0;i<q;i++)
    {
        int t,x,y;
        fin>>t;
        if(t==0)
        {
            fin>>x>>y;
            update(x,y);
        }
        else if(t==1)
        {
            fin>>x>>y;
            fout<<query(y)-query(x-1)<<'\n';
        }
        else if(t==2)
        {
            fin>>x;
            fout<<cautbin(x)<<'\n';
        }
    }

    return 0;
}