#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 MAXBUF = (1 << 18);
char parseBuf[MAXBUF];
char *head;
bool isDigit[255];

void parseInit() {
  int a = fread(parseBuf, 1, MAXBUF, stdin);
  parseBuf[a] = 0;
  head = parseBuf;
}

inline void advanceHead() {
  ++head;
  if (head - parseBuf >= MAXBUF)
    parseInit();
}

int nextInt() {
  int ans = 0;
  for (; !isDigit[*head]; advanceHead());
  for (; isDigit[*head]; advanceHead())
    ans = ans * 10 + (*head) - '0';
  return ans;
}

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() {
  qleft = nextInt() - 1;
  qright = nextInt();
  return query(0, N);
}

void update(int pos) {
  int x = nextInt();
  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() {
  memset(isDigit, 0, sizeof isDigit);
  for (int i = '0'; i <= '9'; ++i)
    isDigit[i] = true;
  assert(freopen(InFile, "r", stdin));
  assert(freopen(OuFile, "w", stdout));
  parseInit();
  int M;
  N = nextInt(), M = nextInt();
  for (int i = 0; i < N; ++i)
    update(i);
  while (M--) {
    int qt = nextInt();
    if (qt == 0)
      update(nextInt() - 1);
    else if (qt == 1)
      printf("%d\n", qft());
    else
      printf("%d\n", query2(nextInt()) + 1);
  }
  return 0;
}