#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
template <typename Monoid>
struct SegTree {
  using Fn = function<Monoid(Monoid, Monoid)>;

  SegTree(int sz_, const Fn fn_, const Monoid &UNITY_) : fn(fn_), UNITY(UNITY_) {
    init(sz_);
    dat.assign(sz << 1, UNITY);
  }

  SegTree(const vector<Monoid> &seq, const Fn fn_, const Monoid &UNITY_) : fn(fn_), UNITY(UNITY_) {
    int seq_sz = seq.size();
    init(seq_sz);
    dat.resize(sz << 1);
    REP(i, seq_sz) dat[i + sz] = seq[i];
    for (int i = sz - 1; i > 0; --i) dat[i] = fn(dat[i << 1], dat[(i << 1) + 1]);
  }

  void update(int node, const Monoid &value) {
    node += sz;
    dat[node] = value;
    while (node >>= 1) dat[node] = fn(dat[node << 1], dat[(node << 1) + 1]);
  }

  Monoid query(int left, int right) {
    Monoid l_res = UNITY, r_res = UNITY;
    for (left += sz, right += sz; left < right; left >>= 1, right >>= 1) {
      if (left & 1) {
        l_res = fn(l_res, dat[left]);
        ++left;
      }
      if (right & 1) {
        --right;
        r_res = fn(dat[right], r_res);
      }
    }
    return fn(l_res, r_res);
  }

  inline Monoid operator[](const int idx) const { return dat[idx + sz]; }

private:
  int sz = 1;
  const Fn fn;
  const Monoid UNITY;
  vector<Monoid> dat;

  void init(int sz_) { while (sz < sz_) sz <<= 1; }
};

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, q; cin >> n >> q;
  vector<long long> a(n); REP(i, n) cin >> a[i];
  SegTree<long long> seg(a, [](long long a, long long b) { return a + b; }, 0LL);
  set<int> st;
  REP(i, n + 1) st.insert(i);
  while (q--) {
    int query, x; cin >> query >> x;
    if (query == 1) {
      st.erase(x);
    } else if (query == 2) {
      st.insert(x);
    } else if (query == 3) {
      --x;
      seg.update(x, seg[x] + 1);
    } else {
      --x;
      auto it2 = st.upper_bound(x);
      auto it1 = it2;
      --it1;
      cout << seg.query(*it1, *it2) << '\n';
    }
  }
  return 0;
}