#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
template<class T> using max_heap = priority_queue<T>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

int main() {
    max_heap<long long> small;
    min_heap<long long> large;
    int q, k; cin >> q >> k;
    while (q--) {
        int t; cin >> t;
        if (t == 1) {
            long long v; cin >> v;
            if (small.size() < k) {
                small.emplace(v);
                continue;
            }
            small.emplace(v);
            large.emplace(small.top()); small.pop();
        } else {
            if (small.size() < k) {
                cout << -1 << endl;
                continue;
            }
            cout << small.top() << endl; small.pop();
            if (!large.empty()) {
                small.emplace(large.top()); large.pop();
            }
        }
    }
    return 0;
}