from heapq import *
q, k = map(int, input().split())
qle, qgt = [], []
for _ in range(q):
    words = map(int, input().split())
    if next(words) == 1:
        v = next(words)
        if len(qle) < k:
            heappush(qle, -v)
        elif v < -qle[0]:
            heappush(qgt, -heappushpop(qle, -v))
        else:
            heappush(qgt, v)
    else:
        if len(qle) < k:
            print(-1)
        elif qgt:
            print(-heapreplace(qle, -heappop(qgt)))
        else:
            print(-heappop(qle))