#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");

const int NMAX = 1000100;

int v[NMAX], tree[4 * NMAX], n, m;

void build(int node, int left, int right)
{
    if(left == right)
    {
        tree[node] = v[right];
        return;
    }
    int mij = (left + right) / 2;
    build(node * 2, left, mij);
    build(node * 2 + 1, mij + 1, right);
    tree[node] = tree[node * 2] + tree[node * 2 + 1];
}

void update(int node, int left, int right, int poz, int val)
{
    if(left == right)
    {
        tree[node] += val;
        return;
    }
    int mij = (left + right) / 2;
    if(poz <= mij)
    {
        update(node * 2, left, mij, poz, val);
    }
    else
    {
        update(node * 2 + 1, mij + 1, right, poz, val);
    }
    tree[node] = tree[node * 2] + tree[node * 2 + 1];
}

int query(int node, int left, int right, int st, int dr)
{
    if(st <= left && right <= dr)
    {
        return tree[node];
    }
    int mij = (left + right) / 2;
    int ans1 = 0, ans2 = 0;
    if(st <= mij)
    {
        ans1 = query(2 * node, left, mij, st, dr);
    }
    if(dr > mij)
    {
        ans2 = query(2 * node + 1, mij + 1, right, st, dr);
    }
    return ans1 + ans2;

}

int search_(int node, int left, int right, int val)
{
    if(tree[node] == val)
    {
        return right;
    }
    if(left == right)
    {
        return -1;
    }
    int mij = (left + right) / 2;
    int ans1 = -1;
    ans1 = search_(2 * node, left, mij, val);
    if(ans1 == val)
        return right;

}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
    }
    build(1, 1, n);
    for(int i = 1; i <= m; i++)
    {
        int cer, a, b;
        fin >> cer;
        if(cer == 2)
        {
            fin >> a;
            fout << search_(1, 1, n, a) << '\n';
        }
        else
        {
            fin >> a >> b;
            if(cer == 0)
            {
                update(1, 1, n, a, b);
            }
            else
            {
                fout << query(1, 1, n, a, b) << '\n';
            }
        }
    }
    return 0;
}