#include <iostream>
#include <fstream>
using namespace std;
int c,i,s,n,m,x,y,a[100006];
void update(int poz, int val)
{
     c=0;
     while(poz<=n)
     {a[poz]+=val;
     while(!(poz&(1<<c))) c++;
     poz+=1<<c;
     c++;
     }
     }
int query(int poz)
{
     c=s=0;
     while(poz>0)
     {s+=a[poz];
     while(!(poz&(1<<c))) c++;
     poz-=1<<c;
     c++;
     }
    return s;
    }
int search(int val)
{
    for(c=1;c<n;c<<=1);
    for(i=0;c;c>>=1)
    if(i+c<=n)
    {if(a[i+c]==val)
             return i+c;
    else
    if(a[i+c]<val)
    {val-=a[i+c];
    i+=c;}
                }
    return -1;
    }
int main ()
{
ifstream f("aib.in");
ofstream g("aib.out");
f>>n>>m;
for(int i=1;i<=n;i++)
{f>>x;
update(i,x);}

while(m)
{f>>x;
if(x==2)
{f>>x;

g<<search(x)<<'\n';
}
else
if(x)
{f>>x>>y; 
g<<query(y)-query(x-1)<<'\n';}
else
{f>>x>>y;
update(x,y);}      
m--;}
 f.close(); g.close();
return 0;
}