import heapq
import sys

input = sys.stdin.buffer.readline

Q, K = map(int, input().split())
h_left, h_right = [], []

for _ in range(Q):
    q = tuple(map(int, input().split()))
    if q[0] == 1:
        v = q[1]
        if len(h_left) < K:
            heapq.heappush(h_left, -v)
        elif -h_left[0] >= v:
            x = -heapq.heappushpop(h_left, -v)
            heapq.heappush(h_right, x)
        else:
            heapq.heappush(h_right, v)
    else:
        if len(h_left) < K:
            print(-1)
        else:
            if h_right:
                y = heapq.heappop(h_right)
                x = -heapq.heapreplace(h_left, -y)
            else:
                x = -heapq.heappop(h_left)
            print(x)
    # print(h_left, h_right)