#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 <random>
#include <assert.h>
using namespace std;

const string file = "aib";

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

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

class AibSum
{
    public:
        AibSum(int size);
        void update(int x, int val);
        int query(int x);
        int find(int x);

        inline static int zeros(int x);
    protected:
    private:
        vector<int> _data;
        int _N;
};

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

AibSum::AibSum(int size)
{
    this->_N = size;
    this->_data.resize(_N + 1, 0);
}

void AibSum::update(int x, int val)
{
    for(int i = x; i <= _N; i += zeros(i))
    {
        _data[i] += val;
    }
}

int AibSum::query(int x)
{
    int result = 0;
    for(int i = x; i > 0; i -= zeros(i))
    {
        result += _data[i];
    }
    return result;
}

int AibSum::find(int x)
{
    int c = 0;
    int step = 1;
    for(step = 1; step < _N; step <<= 1);

    for(; step > 0; step >>= 1)
    {
        if(c + step <= _N && x >= _data[c + step])
        {
            x -= _data[c + step];
            c += step;
            if(x == 0)
            {
                return c;
            }
        }
    }

    return -1;
}

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin >> N >> M;
    AibSum aib(N);
    for(int i = 0; i < N; i++)
    {
        int x;
        fin >> x;
        aib.update(i + 1, x);
    }

    for(int i = 0; i < M; i++)
    {
        int op, x, y;
        fin >> op >> x;
        if(op == 0)
        {
            fin >> y;
            aib.update(x, y);

        }
        else if(op == 1)
        {
            fin >> y;
            int q1 = aib.query(y);
            int q2 = aib.query(x - 1);
            fout << q1 - q2 << "\n";
        }
        else if(op == 2)
        {
            fout << aib.find(x) << "\n";
        }
    }

#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}