#include <bits/stdc++.h>
using namespace std;

/**
8 6
25 42 8 15 0 0 16 67
0 5 12
2 25
2 90
1 7 7
1 2 8
2 241
*/
ifstream fin("aib.in");
ofstream fout("aib.out");
int aib[100003], n;

void Update(int p, int y)
{
    while (p <= n)
    {
        aib[p] += y;
        p += (p & (-p));
    }
}

int Query(int p)
{
    int suma = 0;
    while (p > 0)
    {
        suma += aib[p];
        p -= (p & (-p));
    }
    return suma;
}

/// cauta binar cea mai din stanga pozitie p
/// in care a[1]+...+a[p] = x
/// daca p nu exista returnam -1
/// O(log^2 n)
int CautBin(int x)
{
    int st, dr, mij, p, suma;
    st = 1; dr = n; p = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        suma = Query(mij);
        if (suma == x)
        {
            p = mij;
            dr = mij - 1;
        }
        else if (suma < x) st = mij + 1;
        else dr = mij - 1;
    }
    return p;
}

int main()
{
    int i, op, Q, x, y;
    fin >> n >> Q;
    for (i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i, x);
    }
    while (Q--)
    {
        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 /// op == 2
        {
            fin >> x;
            fout << CautBin(x) << "\n";
        }
    }
    return 0;
}