#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mp make_pair
#define CHECK(x) if(!(x)) return false;
#define CHECKRET(x, y) if(!(x)) return (y);
#define SKIP(x) if((x)) continue;
typedef pair<int, int> pii;

#ifdef INFOARENA
#define ProblemName "aib"
#else
#define ProblemName "fis"
#endif

#define InFile ProblemName ".in"
#define OuFile ProblemName ".out"

const int MAXN = 100010;
int tree[MAXN];
int N;

int qleft, qright;

inline int valInCurNode(int l, int r, int mid) {
  int ans = tree[mid];
  if (l < mid) ans -= tree[(l + mid) / 2];
  if (mid + 1 < r) ans -= tree[(mid + 1 + r) / 2];
  return ans;
}

int query(int l, int r) {
  CHECKRET(l < r, 0);
  CHECKRET(qright > l, 0);
  CHECKRET(r > qleft, 0);
  int mid = (l + r) / 2;
  if (qleft <= l && r <= qright)
    return tree[mid];
  int ans = (qleft <= mid && mid < qright) ? valInCurNode(l, r, mid) : 0;
  ans += query(l, mid);
  ans += query(mid + 1, r);
  return ans;
}

inline int qft(int l, int r) {
  qleft = l, qright = r + 1;
  return query(0, N);
}

void update(int pos, int x) {
  for (int l = 0, r = N; l < r;) {
    int mid = (l + r) / 2;
    tree[mid] += x;
    if (mid == pos) return;
    if (pos < mid) r = mid;
    else l = mid + 1;
  }
}

int query2(int x) {
  int ans = 0;
  for (int l = 0, r = N; l < r;) {
    int mid = (l + r) / 2;
    int cur = tree[mid] - (mid + 1 < r ? tree[(mid + 1 + r) / 2] : 0);
    if (ans + cur == x) return mid;
    if (ans + cur < x) {
      l = mid + 1;
      ans += cur;
    }
    else r = mid;
  }
  return -2;
}

int main() {
  assert(freopen(InFile, "r", stdin));
  assert(freopen(OuFile, "w", stdout));
  int M;
  scanf("%d%d", &N, &M);
  for (int i = 0; i < N; ++i) {
    int x;
    scanf("%d", &x);
    update(i, x);
  }
  while (M--) {
    int qt;
    scanf("%d", &qt);
    if (qt == 0) {
      int a, x;
      scanf("%d%d", &a, &x);
      --a;
      update(a, x);
    }
    else if (qt == 1) {
      int l, r;
      scanf("%d%d", &l, &r);
      --l, --r;
      printf("%d\n", qft(l, r));
    }
    else {
      int x;
      scanf("%d", &x);
      printf("%d\n", query2(x) + 1);
    }
  }
  return 0;
}