#include <bits/stdc++.h>
#define nmax 100000

using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

int v[nmax+5], sum[4*nmax+5];

void build(int nod, int st, int dr) {
    if(st == dr) {
        sum[nod] = v[st];
        return;
    }
    int mid = (st + dr) / 2;
    build(2*nod, st, mid);
    build(2*nod+1, mid+1, dr);
    sum[nod] = sum[2*nod] + sum[2*nod+1];
}

void update(int nod, int st, int dr, int poz, int x) {
    if(st == dr) {
        sum[nod] += x;
        return;
    }
    int mid = (st + dr) / 2;
    if(poz <= mid) {
        update(2*nod, st, mid, poz, x);
    } else {
        update(2*nod+1, mid+1, dr, poz, x);
    }
    sum[nod] += x;
}

int query(int nod, int st, int dr, int left, int right) {
    if(st >= left && dr <= right) {
        return sum[nod];
    }
    int mid = (st + dr) / 2;
    int rez = 0;
    if(left <= mid) {
        rez += query(2*nod, st, mid, left, right);
    }
    if(right > mid) {
        rez += query(2*nod+1, mid+1, dr, left, right);
    }
    return rez;
}

int bs(int nod, int st, int dr, int suma) {
    if(st == dr) {
        if(sum[nod] == suma) {
            return st;
        } else {
            return -1;
        }
    }
    int mid = (st + dr) / 2;
    if(sum[2*nod] >= suma) {
        return bs(2*nod, st, mid, suma);
    } else {
        return bs(2*nod+1, mid+1, dr, suma-sum[2*nod]);
    }
}

int main() {
    int n, m; 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 op; fin >> op;
        if(op == 0) {
            int a, b; fin >> a >> b;
            update(1, 1, n, a, b);
        }
        if(op == 1) {
            int a, b; fin >> a >> b;
            fout << query(1, 1, n, a, b) << "\n";
        }
        if(op == 2) {
            int suma; fin >> suma;
            fout << bs(1, 1, n, suma) << "\n";
        }
    }
    return 0;
}