#include <fstream>

#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")

using namespace std;
const int NMAX=100000;

int aib[NMAX+4];

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

int query(int pos)
{
    int s=0;
    while(pos>0)
    {
        s=s+aib[pos];
        pos=pos&(pos-1);
    }
    return s;
}

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

int bs(int target,int n)
{
    int st,dr,med,last,curr;
    st=1;
    dr=n;
    last=n+1;
    while(st<=dr)
    {
        med=((st+dr)>>1);
        curr=query(med);
        if(curr==target)
            last=med,dr=med-1;
        else
            if(curr>target)
                dr=med-1;
            else
                st=med+1;
    }
    if(last==n+1)
        return -1;
    return last;
}

int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    int n,q,t,x,y,i;
    fin>>n>>q;
    for(i=1;i<=n;i++)
    {
        fin>>x;
        update(i,x,n);
    }
    while(q--)
    {
        fin>>t;
        if(t==0)
        {
            fin>>x>>y;
            update(x,y,n);
        }
        if(t==1)
        {
            fin>>x>>y;
            fout<<query(y)-query(x-1)<<"\n";
        }
        if(t==2)
        {
            fin>>x;
            fout<<bs(x,n)<<"\n";
        }
    }

    fin.close();
    fout.close();
    return 0;
}