#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int n,m,a[N],aib[N];
void Update(int x,int y)
{
    for(int i=x;i<=n;i+=i&-i)
        aib[i]+=y;
}
int Suma(int x)
{
    int s=0;
    for(int i=x;i>0;i-=i&-i)
        s+=aib[i];
    return s;
}
int Query(int x,int y)
{
    return Suma(y)-Suma(x-1);
}
int Search(int x)
{
    int st=1,dr=n,mij;
    while(st<=dr)
    {
        mij=(st+dr)>>1;
        if(Suma(mij)==x) return mij;
        else if(Suma(mij)<x) st=mij+1;
        else dr=mij-1;
    }
    return -1;
}
int main()
{
    int i,op,x,y;
    fin>>n>>m;
    for(i=1;i<=n;i++) fin>>a[i],Update(i,a[i]);
    while(m--)
    {
        fin>>op;
        if(op<2)
        {
            fin>>x>>y;
            if(!op) Update(x,y);
            else fout<<Query(x,y)<<"\n";
        }
        else
        {
            fin>>x;
            fout<<Search(x)<<"\n";
        }
    }
    return 0;
}