// yukicoder: No.833 かっこいい電車
// 2019.7.30 bal4u

#include <stdio.h>

typedef long long ll;

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void out(ll n) { // 正整数の表示（出力）
	int i;
	char b[50];

	i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
	while (i--) pc(b[i]);
	pc('\n');
}

// bit木
ll bit[100005], bitn;

void add(int i, int v) {
    while (i <= bitn) bit[i] += v, i += i & -i;
}
 
ll sum(int i) {
    ll s = 0;
    while (i > 0) s += bit[i], i -= i & -i;
    return s;
}

// 単体車両のカッコよさ、グループの先頭、グループの末尾、グループのカッコよさ
typedef struct { int a, top, r; ll total; } T;
T tbl[100005]; int N;

int top(int x) {
	int t;
	do t = x, x = tbl[x].top;
	while (t != x);
	return x;
}
	
int main()
{
	int i, id, Q, x, t; ll s;

	bitn = N = in(), Q = in();
	for (i = 1; i <= N; i++) {
		tbl[i].a = t = in(), tbl[i].top = i, tbl[i].r = i;
		tbl[i].total = t, add(i, t); 
	}
	while (Q--) {
		id = gc() & 0xf, gc(), x = in();
		if (id == 1) { // connecct
			if ((t = top(x)) != top(x+1)) {
				tbl[x+1].top = t,
				tbl[t].r = tbl[x+1].r;
				tbl[t].total += tbl[x+1].total;
			}
		} else if (id == 2) { // separate
			if ((t = top(x)) == top(x+1)) {
				tbl[x+1].r = tbl[t].r;
				tbl[t].r = x;
				tbl[x+1].total = sum(tbl[x+1].r) - sum(x);
				tbl[t].total -= tbl[x+1].total;
				for (i = tbl[++x].r; i >= x; i--) tbl[i].top = x; 
			}
		} else if (id == 3) { // remodel
			tbl[x].a++, add(x, 1), tbl[top(x)].total++;
		} else { // attractiveness
			out(tbl[top(x)].total);
		}
	}
	return 0;
}