import heapq
import sys
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
readline=sys.stdin.readline

Q,K=map(int,readline().split())
queue0,queue1=[],[]
for _ in range(Q):
    data=map(int,readline().split())
    if next(data)==1:
        v=next(data)
        if len(queue0)<K:
            _heappush_max(queue0,v)
        else:
            heappush(queue1,v)
            x=_heappop_max(queue0)
            y=heappop(queue1)
            if x>y:
                x,y=y,x
            _heappush_max(queue0,x)
            heappush(queue1,y)
    else:
        if len(queue0)<K:
            ans=-1
        else:
            ans=_heappop_max(queue0)
            if queue1:
                _heappush_max(queue0,heappop(queue1))
        print(ans)