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

#define ll long long
#define pb push_back
const int NMax = 1e5 + 5;
const int inf = 1e9 + 5;

int N,M;
int aib[NMax];

void update(int,int);
int query(int);
int querySingle(int);
int findK(int);

int main() {
    in>>N>>M;
    for (int i=1;i <= N;++i) {
        int val;
        in>>val;

        update(i,val);
    }

    while (M--) {
        int tip,a,b;
        in>>tip>>a;

        switch(tip) {
        case 0:
            in>>b;
            update(a,b);
            break;
        case 1:
            in>>b;

            if (a == b) {
                out<<querySingle(a)<<'\n';
            }
            else {
                out<<query(b) - query(a-1)<<'\n';
            }
            break;
        case 2:
            out<<((a == 0) ? -1 : findK(a))<<'\n';
        }
    }

    in.close();out.close();
    return 0;
}

void update(int idx,int add) {
    while (idx <= N) {
        aib[idx] += add;

        idx += idx & (~idx + 1);
    }
}

int query(int idx) {
    int ans = 0;

    while (idx) {
        ans += aib[idx];

        idx -= idx & (~idx + 1);
    }

    return ans;
}

int querySingle(int idx) {
    int sum1 = aib[idx],
        sum2 = 0,
        pre = idx-1,
        lca = idx - (idx & (~idx + 1));

    while (pre != lca) {
        sum2 += aib[pre];

        pre -= pre & (~pre + 1);
    }

    return sum1 - sum2;
}

int findK(int sum) {
    int idx = 0,pw = 1;
    for (;pw <= N;pw <<= 1) ;
    pw >>= 1;

    while (pw) {
        if (idx + pw <= N && aib[idx+pw] <= sum) {
            sum -= aib[idx += pw];
        }

        pw >>= 1;
    }

    if (!sum) {
        return idx;
    }
    return -1;
}