#include<cstdio>
using namespace std;
const int nmax = 100005;
int n,m,i,val,poz,x,y,aib[nmax];
void update(int poz,int val)
{
    for(int i=poz;i<=n;i+=i&(-i))
        aib[i]+=val;
}
int sum(int poz)
{
    int r=0;
    for(int i=poz;i;i-=i&(-i))
        r+=aib[i];
    return r;
}
int query(int x)
{
    int step,r=0,y=x;
    for(step=1<<17;step;step>>=1)
        if(r+step<=n && aib[r+step]<x)
        {
            r+=step;
            x-=aib[r];
        }
    if(sum(r+1)==y) return r+1;
    return -1;
}
int main()
{
	freopen("aib.in","r",stdin);
	freopen("aib.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
	{
	    scanf("%d",&x);
	    update(i,x);
	}
	for(;m;m--)
	{
	    scanf("%d",&i);
	    if(i==0)
	    {
	        scanf("%d%d",&poz,&val);
	        update(poz,val);
	    }
	    else if(i==1)
	    {
	        scanf("%d%d",&x,&y);
	        printf("%d\n",sum(y)-sum(x-1));
	    }
	    else
	    {
	        scanf("%d",&x);
	        printf("%d\n",query(x));
	    }
	}
	return 0;
}