#include <iostream>
#include <cstdio>
#include <cmath>
#include <functional>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
template<class T, class Compare = less<T> >
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template<class T, class Compare = greater<T> >
using MinHeap = priority_queue<T, vector<T>, Compare>;
using llong = long long;

MaxHeap<llong> find_Kth;
MinHeap<llong> others;
llong Q, K;
llong com, v;

int main() {

    cin >> Q >> K;


    while(Q--) {
        cin >> com;

        if (com == 1) {
            cin >> v;

            find_Kth.push(v);

            if (find_Kth.size() > K) {
                others.push(find_Kth.top());
                find_Kth.pop();
            }
        }
        else if (com == 2) {
            if (find_Kth.size() >= K) {
                printf("%lld\n", find_Kth.top());

                find_Kth.pop();

                if (!others.empty()) {
                    find_Kth.push(others.top());
                    others.pop();
                }
            }
            else {
                printf("%lld\n", -1ll);
            }
        }
    }

    return 0;
}