#include <bits/stdc++.h>
using namespace std;
#define debug_var(x) cout << #x << '=' << x << endl;
#define debug_stl(x) for(auto k : x) cout << k << ' '; cout << endl;
#define debug_map(x) for(auto k : x) cout << k.first << ':' << k.second << endl;
#define read_vector(x, s, k) for(auto i = s; i <= k; ++i) cin >> x[i];
#define read_2dvector(x, s, l1, l2) for(auto i = s; i <= l1; ++i) for(auto j = s; j <= l2; ++j) cin >> x[i][j];
#define vec vector
#define ull unsigned long long int
#define ll long long int
#define str string
#define umap unordered_map
#define uset unordered_set
#define mset multiset
#define umset unordered_multiset
#define NMax 100000

int aib[NMax + 1], n, m;

void add(int pos, int delta) {
  for(int i = pos; i <= n; i += i & -i) aib[i] += delta;
}
int sum(int pos) {
  int sum = 0;
  for(int i = pos; i > 0; i -= i & -i) sum += aib[i];
  return sum;
}

int main() {
  freopen("aib.in", "r", stdin);
  freopen("aib.out", "w", stdout);
  scanf("%d%d", &n, &m);
  for(int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    add(i, x);
  }
  for(int i = 1; i <= m; ++i) {
    int type, x, y;
    scanf("%d", &type);
    switch (type) {
      case 0: {
        scanf("%d%d", &x, &y);
        add(x, y);
        break;
      }
      case 1: {
        scanf("%d%d", &x, &y);
        printf("%d\n", sum(y) - sum(x - 1));
        break;
      }
      case 2: {
        scanf("%d", &x);
        int k = - 1;
        for(int i = 1; i <= n; ++i) {
          if(sum(i) > x) break;
          if(sum(i) == x) {k = i; break;}
        }
        printf("%d\n", k);
        break;
      }
    }
  }
  return 0;
}