Q, K = gets.split.map(&:to_i)
S = []
Q.times do |i|
    q = gets.split.map(&:to_i)
    if q[0] == 1
        ind = S.bsearch_index{|x| x >= q[1]}
        S.insert(ind ? ind : S.size, q[1])
    else
        if S.size < K
            p -1
        else
            p S[K - 1]
            S.delete_at(K - 1)
        end
    end
end