#include <bits/stdc++.h>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
vector<int> tree;
int n;
void update(int pos, int val) {
  while (pos <= n) {
    tree[pos] += val;
    pos += pos & (-pos);
  }
}

int query(int pos) {
  int s = 0;
  while (pos > 0) {
    s += tree[pos];
    pos -= (pos & -pos);
  }
  return s;
}

int main() {
  int q;
  fin >> n >> q;
  tree.resize(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    int val;
    fin >> val;
    update(i, val);
  }
  for (int i = 0; i < q; i++) {
    int t;
    fin >> t;
    if (t == 0) {
      int a, b;
      fin >> a >> b;
      update(a, b);
    }
    if (t == 1) {
      int a, b, ans;
      fin >> a >> b;
      ans = query(b) - query(a - 1);
      fout << ans << "\n";
    }
    if (t == 2) {
      int a, left = 0, right = n - 1;
      fin >> a;
      while (left <= right) {
        int mid = (left + right) / 2;
        if (query(mid) < a)
          left = mid + 1;
        else
          right = mid - 1;
      }
      fout << left << "\n";
    }
  }
}