import bisect
n, k, q = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
k -= 1

for _ in range(q):
    q = list(map(int, input().split()))
    if q[0] == 1:
        bisect.insort(a, q[1])
    elif q[0] == 2:
        b = a.pop(k)
        b += q[1]
        bisect.insort(a, b)
    else:
        print(a[k])