import bisect

Q, K = map(int, input().split())

S = []  # sorted list
size = 0

for i in range(Q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        bisect.insort_left(S, query[1])
        size += 1
    else:
        if size >= K:
            print(S.pop(K - 1))
            size -= 1
        else:
            print(-1)