#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;

const string file = "aib";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;

vector<int> AIB;
int N, M;

inline int zeros(int x)
{
	return (x ^ (x-1)) & x;
}

void Update(int pos, int val)
{
	for(int i = pos; i <= N; i += zeros(i))
	{
		AIB[i] += val;
	}
}

int Query(int pos)
{
	int r = 0;

	for(int i = pos; i > 0; i -= zeros(i))
	{
		r += AIB[i];
	}

	return r;
}

int Search(int val)
{
	int step = 1;
	for(;step < N; step <<=1);

	for(int i = 0; step; step >>= 1)
	{
		if( i + step <= N)
		{
			if(AIB[i+step] <= val)
			{
				val -= AIB[i+step];
				i += step;
				if(val == 0)
				{
					return i;
				}
			}
		}
	}


	return -1;
}

int main()
{
	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);
	
	
	
	fin >> N >> M;
	AIB.resize(N + 1);
	for(int i = 1; i <= N; i++)
	{
		int x;
		fin >> x;
		Update(i, x);
	}

	for(int i = 0; i < M; i++)
	{
		int op;
		int x, y;
		fin >> op;
		if(op == 0)
		{
			fin >> x >> y;
			Update(x, y);
		}
		else if(op == 1)
		{
			fin >> x >> y;
			fout << Query(y) - Query(x - 1) << "\n";;
		}
		else if(op == 2)
		{
			fin >> x;
			fout << Search(x) << "\n";
		}
	}


	fin.close();
	fout.close();
}