#include <bits/stdc++.h>
using ll=long long;
#define S second
#define F first
#define endl '\n'
#define spid ios_base::sync_with_stdio(false);cin.tie(NULL);
const int mod=1e9+7;
const double pi=3.14159265359;
const int maxn=200001;
using namespace std;

int n,A[maxn],T[maxn],q;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}
	
	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
	
	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

int up(int i){
	return i-(i&(-i));
}

int down(int i){
	return i+(i&(-i));
}

int qr(int l,int r){
	int sum1=0,sum2=0;
	while(l){
		sum1+=T[l];
		l=up(l);
	}
	while(r){
		sum2+=T[r];
		r=up(r);
	}
	return sum2-sum1;
}

void upd(int x,int delta){
	if(x>n)return;
	T[x]+=delta;
	upd(down(x),delta);
}

int search(int nr){
	int k=0;
	while((1<<k)<=n)k++;
	k--;
	int i=0;
	while(k>=0){
		if(i+(1<<k)<=n){
			if(T[i+(1<<k)]<=nr){
				nr-=T[i+(1<<k)];
				i+=(1<<k);
				if(!nr)return i;
			}
		}
		k--;
	}
	return -1;
}

int main(){
	InParser fin("aib.in");
	ofstream cout("aib.out");
	fin>>n>>q;
	for(int i=1;i<=n;i++){
		fin>>A[i];
		T[i]=A[i];
	}
	for(int i=1;i<=n;i++){
		int j=down(i);
		if(j<=n)T[j]+=T[i];
	}
	while(q--){
		int c;
		fin>>c;
		if(c==0){
			int a,b;
			fin>>a>>b;
			upd(a,b);
		}
		else if(c==1){
			int l,r;
			fin>>l>>r;
			cout<<qr(l-1,r)<<endl;
		}
		else{
			int nr;
			fin>>nr;
			cout<<search(nr)<<endl;
		}
	}
	
	
}