#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int q, k;
    cin >> q >> k;

    priority_queue<int64_t> q0;
    priority_queue<int64_t, vector<int64_t>, greater<>> q1;
    for (int i = 0; i < q; i++) {
        int t;
        cin >> t;

        if (t == 1) {
            int64_t v;
            cin >> v;
            if (q0.size() < k) {
                q0.push(v);
            } else {
                if (v < q0.top()) {
                    q1.push(q0.top());
                    q0.pop();
                    q0.push(v);
                } else {
                    q1.push(v);
                }
            }
        } else {
            if (q0.size() < k) {
                cout << -1 << '\n';
            } else {
                cout << q0.top() << '\n';
                q0.pop();
                if (q1.size() > 0) {
                    q0.push(q1.top());
                    q1.pop();
                }
            }
        }
    }

    return 0;
}