import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Comparator;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int q = in.nextInt();
            int k = in.nextInt();
            PriorityQueue<Long> maxHeap = new PriorityQueue<>(Comparator.reverseOrder());
            PriorityQueue<Long> minHeap = new PriorityQueue<>(Comparator.naturalOrder());

            for (int i = 0; i < q; i++) {
                int qn = in.nextInt();
                if (qn == 1) {
                    long next = in.nextLong();
                    if (maxHeap.size() < k) {
                        maxHeap.add(next);
                    } else {
                        if (next < maxHeap.peek()) {
                            minHeap.add(maxHeap.poll());
                            maxHeap.add(next);
                        } else {
                            minHeap.add(next);
                        }
                    }
                } else {
                    if (maxHeap.size() < k) {
                        out.println(-1);
                    } else {
                        out.println();
                        out.println(maxHeap.poll());
                        if (minHeap.size() > 0) maxHeap.add(minHeap.poll());
                    }
                }
            }
        }

    }
}