q,k = map(int,input().split())
index = k-1
lst = []

def ins(x):
    l_len=len(lst)
    if l_len==0:
        lst.append(x)
    else:
        s,t = 0,l_len
        while True:
            m=(s+t)//2
            if m==l_len:
                lst.append(x)
                return
            elif lst[m]==x or not s<t:
                lst.insert(m,x)
                return
            elif lst[m]<x:
                s = m+1
            else:
                t = m

for i in range(q):
    s=list(map(int,input().split()))
    if s[0]==1:
        ins(s[1])
    else:
        if len(lst)>=k:
            print(lst.pop(index))
        else:
            print(-1)