#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;
const int NMAX=100001;

int N,Q;
vector<int> bit(NMAX,0);

void update(int poz,int add)
{
	while(poz<=N)
		bit[poz]+=add,
		poz+=(poz&-poz);
}

int query(int poz)
{
	int s=0;
	while(poz>0)
		s+=bit[poz],
		poz-=(poz&-poz);
	return s;
}

int search(int s)
{
	int ls=0,ld=N+1,pm;
	for(pm=(ls+ld)>>1;pm>ls&&pm<ld;pm=(ls+ld)>>1)
	{
		int vm=query(pm);
		if(vm>s)ld=pm;
		else if(vm<s)ls=pm;
		else return pm;
	}
	return -1;
}


int main()
{
	int op,a,b;
	freopen("aib.in","r",stdin);
	freopen("aib.out","w",stdout);

	cin>>N>>Q;
	for(int i=1,add;i<=N;i++)
	{
		cin>>add;
		update(i,add);
	}

	while(Q--)
	{
		cin>>op>>a;
		if(op==2)
			cout<<search(a)<<" \n";
		else
			if(cin>>b&&op==1)
				cout<<query(b)-query(a-1)<<" \n";
			else
				update(a,b);
	}
}