import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################


n, k, q = na()
a = sorted(na())

from heapq import *
# 小さいほう K 個を管理
hq1 = []
# 大きいほう N - K 
hq2 = []

def add(x):
    if len(hq1) < k:
        heappush(hq1, -x)
    else:
        heappush(hq1, -x)
        heappush(hq2, -heappop(hq1))

def pop():
    x = -heappop(hq1)
    if hq2:
        heappush(hq1, -heappop(hq2))
    return x
for i in range(n):
    add(a[i])
for _ in range(q):
    que = na()
    if que[0] == 1:
        add(que[1])
    elif que[0] == 2:
        x = pop()
        add(x + que[1])
        # print("!", x, que[1])
    else:
        print(-hq1[0])
    # print([-x for x in hq1], hq2)