from bisect import bisect_left, insort_left
from itertools import accumulate


def main():
    N, Q = map(int, input().split())
    A = list(map(int, input().split()))

    disconnections = [idx for idx in range(N-1)]
    partial_sum = list(accumulate(A))

    for _ in range(Q):
        query_type, x = map(int, input().split())
        x -= 1  # 0-index
        match query_type:
            case 1:
                try:
                    disconnections.remove(x)
                except ValueError:
                    pass

            case 2:
                if x not in disconnections:
                    insort_left(disconnections, x)

            case 3:
                partial_sum[x:] = list(map(lambda num: num+1, partial_sum[x:]))

            case 4:
                if not disconnections:
                    print(partial_sum[-1])
                    continue

                range_idx = bisect_left(disconnections, x)
                if range_idx == len(disconnections):
                    print(partial_sum[-1] - partial_sum[disconnections[-1]])
                    continue

                if range_idx == 0:
                    print(partial_sum[0])
                    continue

                print(partial_sum[disconnections[range_idx]] -
                      partial_sum[disconnections[range_idx-1]])


if __name__ == "__main__":
    main()