#include <iostream>
#include <string>
using namespace std;
using ll = long long;
ll n,q,t[200010] = {};
int l[100010],r[100010];
void built(){
	for(int i = n-1;i>0;i--){
		t[i] = t[i<<1] + t[i<<1|1];
	}
}

void update(ll p,ll a){
	for(t[p+=n] += a;p>1;p >>= 1){
		t[p>>1] = t[p] + t[p^1];
	}
}

ll query(int l, int r){
	ll sum = 0;
	for(l += n, r += n; l<r; l >>= 1,r >>= 1){
		if(l&1) sum += t[l++];
		if(r&1) sum += t[--r];
	}
	return sum;
}

int le(int x){
	if(l[x]) return x;
	int a = 0,b = x;
	while(b - a>1){
		int mid = (a + b)/2;
		if(l[mid]) a = mid;
		else b = mid;
	}
	return a;
}

int ri(int x){
	if(r[x]) return x;
	int a = x,b = n - 1;
	while(b - a>1){
		int mid = (a + b)/2;
		if(r[mid]) b = mid;
		else a = mid;
	}
	return b;
}

int main(){
	int i;
	cin >> n >> q;
	for(i=0;i<n;i++){
		int a; cin >> a; t[i + n] = a;
		l[i] = 1; r[i] = 1;
	}
	built();
	for(i=0;i<q;i++){
		int w,x;
		cin >> w >> x; x--;
		if(w==1){
			r[x] = 0; l[x + 1] = 0;
		}
		if(w==2){
			r[x] = 1; l[x + 1] = 1;
		}
		if(w==3){
			update(x,1);
		}
		if(w==4){
			cout << query(le(x),ri(x) + 1) << endl;
		}
	}
}