import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.LinkedList;
import java.util.Collections;

/**
 * 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();
            LinkedList<Long> num = new LinkedList<>();
            for (int i = 0; i < q; i++) {
                int qn = in.nextInt();
                if (qn == 1) {
                    num.add(in.nextLong());
                } else {
                    if (num.size() < k) {
                        out.println(-1);
                    } else {
                        Collections.sort(num);
                        long cn = num.get(k - 1);
                        out.println(cn);
                        num.remove(k - 1);
                    }
                }
                out.flush();
            }
        }

    }
}