import heapq

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

heap_k_least = []
heap_other = []

size = 0

ans = []
for i in range(Q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        if size < K:
            heapq.heappush(heap_k_least, -query[1])
            size += 1
        elif -heap_k_least[0] > query[1]:
            heapq.heappush(heap_other, -heapq.heappop(heap_k_least))
            heapq.heappush(heap_k_least, -query[1])
        else:
            heapq.heappush(heap_other, query[1])
    else:
        if size >= K:
            ans.append(-heap_k_least[0])
            if heap_other:
                heap_k_least[0] = -heapq.heappop(heap_other)
            else:
                heapq.heappop(heap_k_least)
                size -= 1
        else:
            ans.append(-1)
            
print ('\n'.join(map(str,ans)))