import heapq

v=[];x=[]
q,k=map(int,input().split())
for i in range(q):
    c=list(map(int,input().split()))
    if c[0]==1:
        heapq.heappush(v,-c[1])
        if len(v)>k:
            heapq.heappush(x,-heapq.heappop(v))
    else:
        if len(v)==k:
            print(-heapq.heappop(v))
        else:
            print(-1)
        if len(v)<k and x:
            heapq.heappush(v,-heapq.heappop(x))