#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 100005;

int n, m, i, x, y, op, poz, val, lim, bit[nmax];

void update(int poz, int val)
{
    for(int i = poz; i <= n; i += i & (-i))
        bit[i] += val;
}

int sum(int poz)
{
    int r = 0;
    for(int i = poz; i; i -= i & (-i))
        r += bit[i];
    return r;
}

int query(int x)
{
    int poz = 0;
    int y = x;
    for(int step = lim; step; step /= 2)
        if(poz + step < n && bit[poz + step] < x)
        {
            x -= bit[poz + step];
            poz += step;
        }

    return (sum(poz + 1) == y) ? poz + 1 : -1;
}

int main()
{
    freopen("aib.in", "r", stdin);
    freopen("aib.out", "w", stdout);

    scanf("%d%d", &n, &m);

    for(lim = 1; lim <= n; lim *= 2);

    for(i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        update(i, x);
    }

    for(; m; m--)
    {
        scanf("%d", &op);
        if(op == 0)
        {
            scanf("%d%d", &poz, &val);
            update(poz, val);
        }
        else if(op == 1)
        {
            scanf("%d%d", &x, &y);
            printf("%d\n", sum(y) - sum(x - 1));
        }
        else
        {
            scanf("%d\n", &x);
            printf("%d\n", query(x));
        }
    }

    return 0;
}