import heapq

Q,K=map(int,input().split())
X=0
F=0

A,B=[],[]

Z=[0]*Q
for _ in range(Q):
    T=list(map(int,input().split()))

    if T[0]==1:
        v=T[1]
        X+=1

        if X>K:
            if v<-A[0]:
                u=-heapq.heappop(A)
                heapq.heappush(A,-v)
                heapq.heappush(B,u)
            else:
                heapq.heappush(B,v)
        else:
            heapq.heappush(A,-v)

    else:
        if X>=K:
            Z[F]=-heapq.heappop(A)

            if X>K:
                u=heapq.heappop(B)
                heapq.heappush(A,-u)
            X-=1
        else:
            Z[F]=-1
        F+=1

print("\n".join(map(str,Z[:F])))