#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <ctime>
#include <string>
#include <algorithm>
using namespace std;
ifstream ff("aib.in");
ofstream gg("aib.out");

int n, m, aa[100001];

int qry(int i){
	int s=0;
	while(i>0){ s+=aa[i]; i-=i&-i; }
	return s;
}

int upd(int i, int x){
	while(i<=n){ aa[i]+=x; i+=i&-i; }
}

int cb(int x){
	int l=1, r=n, m;
	while(r-l>1){
		m=(l+r)/2;
		if(qry(m)<=x)l=m; else r=m-1;
	}
	return qry(l)==x?l:qry(r)==x?r:-1;
}

int main(){
	int x, y, op;
	ff >> n >> m;
	for(int i=1;i<=n;i++){
		ff >> x;
		upd(i, x); }
	for(int i=1;i<=m;i++){
		ff >> op;
		if(op==2){ ff >> x; gg << cb(x) << "\n"; } else {
			ff >> x >> y;
			if(!op) upd(x, y); else gg << qry(y)-qry(x-1) << "\n"; 
		}
	}
	return 0;
}