#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <deque>
#include <ctime>
#include <queue>

#define ll long long
#define ull unsigned long long
#define pb push_back
using zint = int;
using namespace std;
const int inf = 1e9 + 5;
const int NMax = 1e5 + 5;
ifstream in("aib.in");
ofstream out("aib.out");

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;

        if (tip == 0) {
            in>>b;
            update(a,b);
        }
        else if (tip == 1) {
            in>>b;
            out<<( (a == b) ? querySingle(a) : query(b) - query(a-1) )<<'\n';
        }
        else {
            out<<( (a == 0) ? -1 : findK(a) )<<'\n';
        }
    }

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

void update(int idx,int val) {
    while (idx <= N) {
        aib[idx] += val;
        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 ans = 0, sum1 = aib[idx], pre = idx-1, sum2 = 0, lca = idx - (idx & (~idx + 1));
    while (pre != lca) {
        sum2 += aib[pre];
        pre -= pre & (~pre + 1);
    }

    return sum1 - sum2;
}

int findK(int sum) {
    int pw = 1;
    while (pw <= N) {
        pw <<= 1;
    }
    pw >>= 1;

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

        pw >>= 1;
    }

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