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