class BIT:
    def __init__(self, n):
        self.size = n
        self.tree = [0]*(n+1)
 
    def build(self, list):
        self.tree[1:] = list.copy()
        for i in range(self.size+1):
            j = i + (i & (-i))
            if j < self.size+1:
                self.tree[j] += self.tree[i]

    def sum(self, i):
        # [0, i) の要素の総和を返す
        s = 0
        while i>0:
            s += self.tree[i]
            i -= i & -i
        return s
    # 0 index を 1 index に変更  転倒数を求めるなら1を足していく
    def add(self, i, x):
        i += 1
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    # 総和がx以上になる位置のindex をbinary search
    def bsearch(self,x):
        le = 0
        ri = 1<<(self.size.bit_length()-1)
        while ri > 0:
            if le+ri <= self.size and self.tree[le+ri]<x:
                x -= self.tree[le+ri]
                le += ri
            ri >>= 1
        return le+1


n,q = map(int,input().split())
A = list(map(int,input().split()))
bit = BIT(n+5)
bit2 = BIT(n+5)
connect = [0]*n
bit.build([0]+A+[0]*4)
bit2.build([1]*(n+5))
for _ in range(q):
    t,x = map(int,input().split())

    if t == 1:
        if connect[x] == 0:
            connect[x] = 1
            bit2.add(x,-1)
    elif t == 2:
        if connect[x] == 1:
            connect[x] = 0
            bit2.add(x,1)
    
    elif t == 3:
        bit.add(x,1)
    
    else:
        num = bit2.sum(x)

        lind = bit2.bsearch(num)
        rind = bit2.bsearch(num+1)
        print(bit.sum(rind)-bit.sum(lind))