#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,k,m,a,b,x,v[100005],s[100005],y,mij;
int slb(int x)
{return x & -x; }
void update(int x,int y)
{
	for (;x<=n;x+=slb(x)) 
		s[x]+=y;
}
int query(int x)
{
	int sum=0;
	for (;x>=1;x-=slb(x))
		sum+=s[x];
	return sum;
}
int bin(int st,int dr,int x)
{
	int mij=(st+dr)/2;
	if (st<=dr) 
	{
		if (query(mij)==x) return mij;
		if (query(mij)>x) bin(st,mij-1,x);
		if (query(mij)<x) bin(mij+1,dr,x);
	}else 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",&v[i]),update(i,v[i]);
	for (i=1;i<=m;i++)
	{
		scanf("%d",&k);
		if (k==0) scanf("%d %d",&x,&y),update(x,y);
		if (k==1) scanf("%d %d",&x,&y),printf("%d\n",query(y)-query(x-1));
		if (k==2) scanf("%d",&x),printf("%d\n",bin(1,n,x));
	}
	return 0;
}