#include <fstream>

using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

int N, M, pow = 1;
int aib[100005];

inline int LastBit(int x)
{
    return x & (-x);
}

void Update(int pos, int value)
{
    for(int i = pos; i <= N; i += LastBit(i))
        aib[i] += value;
}

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

    for(int i = pos; i > 0; i -= LastBit(i))
        answer += aib[i];

    return answer;
}

int Search(int sum)
{
    if(sum == 0)
        return -1;

    int step = pow;
    int cursor = 0;

    for(; step > 0; step >>= 1)
        if(cursor + step <= N && aib[cursor + step] <= sum)
        {
            cursor += step;
            sum -= aib[cursor];

            if(sum == 0)
                return cursor;
        }

    return -1;
}

int main()
{
    int tip, a, b;

    fin >> N >> M;

    for(; pow <= N; pow <<= 1);

    for(int i = 1; i <= N; i++)
    {
        fin >> a;
        Update(i, a);
    }

    for(int i = 1; i <= M; i++)
    {
        fin >> tip;

        if(tip == 0)
        {
            fin >> a >> b;
            Update(a, b);
        }
        else if(tip == 1)
        {
            fin >> a >> b;
            fout << Query(b) - Query(a - 1) << '\n';
        }
        else
        {
            fin >> a;
            fout << Search(a) << '\n';
        }
    }

    return 0;
}