#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;

int main() {
    multiset<long long> small;
    multiset<long long> large;
    int q, k; cin >> q >> k;
    while (q--) {
        int t; cin >> t;
        if (t == 1) {
            long long v; cin >> v;
            small.emplace(v);
            if (small.size() > k) {
                large.emplace(*small.rbegin());
                small.erase(--small.end());
            }
        } else {
            if (small.size() < k) {
                cout << -1 << endl;
                continue;
            }
            cout << *small.rbegin() << endl;
            small.erase(--small.end());
            if (!large.empty()) {
                small.emplace(*large.begin());
                large.erase(large.begin());
            }
        }
    }
    return 0;
}