#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

class BIT {
private:
	int N;
	vector<ll> node;
public:
	BIT(int M) {
		node = vector<ll>(M + 1, 0);
		N = M;
	}

	ll sum(int i) {
		ll s = 0;
		while (i > 0) {
			s += node[i];
			i -= i & -i;
		}
		return s;
	}

	ll sum(int i, int j) {
		ll l = sum(i - 1);
		ll r = sum(j);
		return r - l;
	}

	void add(int i, ll x) {
		while (i <= N) {
			node[i] += x;
			i += i & -i;
		}
	}
};

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	int N, Q; scanf("%d %d", &N, &Q);
	BIT bit(N + 1);
	for (int i = 0; i < N; i++) {
		int x; scanf("%d", &x);
		bit.add(i + 1, x);
	}
	set<int> s; for (int i = 1; i <= N + 1; i++) s.insert(i);
	while (Q--) {
		int q; scanf("%d", &q);
		int x; scanf("%d", &x);
		if (q == 1) {
			if (s.find(x + 1) != s.end()) s.erase(s.find(x + 1));
		}
		if (q == 2) {
			s.insert(x + 1);
		}
		if (q == 3) {
			bit.add(x, 1);
		}
		if (q == 4) {
			auto itr2 = s.upper_bound(x);
			auto itr1 = prev(itr2);
			printf("%lld\n", bit.sum(*itr1, *itr2 - 1));
		}
	}
	return 0;
	/*
		おまじないを使ったらscanfとprintf関連注意！！！！！！！！！！！！
	*/
}