import sys
input = sys.stdin.readline

q, k = map(int, input().split())

MIN = []
MAX = []
import heapq
heapq.heapify(MIN)
heapq.heapify(MAX)

for _ in range(q):
    query = list(map(int, input().split()))
    if len(query) == 1:
        if len(MIN) < k:
            print(-1)
        else:
            print((-1)*heapq.heappop(MIN))
            if len(MAX) > 0:
                v = heapq.heappop(MAX)
                heapq.heappush(MIN, (-1)*v)
    else:
        c, v = query
        if len(MIN) < k:
            heapq.heappush(MIN, (-1)*v)
        else:
            u = (-1)*heapq.heappop(MIN)
            if u <= v:
                heapq.heappush(MIN, (-1)*u)
                heapq.heappush(MAX, v)
            else:
                heapq.heappush(MIN, (-1)*v)
                heapq.heappush(MAX, u)