#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<class V> struct BIT {
    BIT() {}  // [L, R)
    int NV;vector<V> bit;
    BIT(int n){ init(n); }
    void init(int n) { NV = 1; while (NV < n)NV *= 2; bit.resize(NV); clear(); }
    V operator[](int e) { V s = 0; e++; while (e) s += bit[e - 1], e -= e&-e; return s; }
    void add(int e, V v) { e++; while (e <= NV) bit[e - 1] += v, e += e&-e; }
    int lower_bound(V val) { 
        V tv = 0; int i, ent = 0; for (i = NV - 1; i >= 0; i--)
        if(tv+bit[ent+(1<<i)-1]<=val)tv+=bit[ent+(1<<i)-1],ent += (1 << i);return ent;
    }
    V get(int L, int R) {
        assert(0 <= L); assert(R <= NV); assert(L <= R);
        V res = 0; if(R) res += operator[](R - 1); if (L) res -= operator[](L - 1);return res;
    }
	void update(int i, V v) { add(i, v - get(i, i + 1)); }
    void clear() { rep(i, 0, NV) bit[i] = 0; }
};
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　  |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/






BIT<ll> bit, connect;
int N, Q;
int A[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> Q;
	rep(i, 0, N) cin >> A[i];
	bit.init(N);
	rep(i, 0, N) bit.add(i, A[i]);
	connect.init(N);

	rep(q, 0, Q) {
		int t, x; cin >> t >> x; x--;

		if (t == 1) connect.update(x, 1);
		else if (t == 2) connect.update(x, 0);
		else if (t == 3) bit.add(x, 1);
		else {
			int ok, ng;

			int L, R;

			ng = -1, ok = x;
			if (ng == ok) L = x;
			else {
				while (ng + 1 != ok) {
					int md = (ng + ok) / 2;
					int len = x - md;
					if (connect.get(md, x) == len) ok = md;
					else ng = md;
				}
				L = ok;
			}

			ng = N;
			ok = x;
			if (ok == ng) R = x;
			else {
				while (ok + 1 != ng) {
					int md = (ok + ng) / 2;
					int len = md - x;
					if (connect.get(x, md) == len) ok = md;
					else ng = md;
				}
				R = ok;
			}

			ll ans = bit.get(L, R + 1);
			printf("%lld\n", ans);
		}
	}
}