import heapq

q,k = map(int,input().split())
low,high,ans = [],[],[]
size = 0

for i in range(q):
    s = list(map(int,input().split()))
    if s[0]==1:
        if size<k:
            heapq.heappush(low,-s[1])
            size+=1
        elif -low[0]>s[1]:
            heapq.heappush(high,-heapq.heappop(low))
            heapq.heappush(low,-s[1])
        else:
            heapq.heappush(high,s[1])
    else:
        if size==k:
            ans.append(-low[0])
            if high:
                low[0] = -heapq.heappop(high)
            else:
                heapq.heappop(low)
                size-=1
        else:
            ans.append(-1)

print("\n".join(map(str,ans)))