#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 2000000000;
constexpr long long INF= 2000000000000000000;

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 0;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 1000000007;

int main() {
    int q,k;
    cin >> q >> k;
    priority_queue<long long> que;
    priority_queue<long long,vector<long long>,greater<long long>> que2;
    for(int i = 0;i < q;i++) {
        int t;
        cin >> t;
        if(t == 1) {
            long long v;
            cin >> v;
            if(que.size() == k) {
                que.push(v);
                que2.push(que.top());
                que.pop();
            }
            else que.push(v);
        }
        else {
            if(que.size() < k) cout << -1 << endl;
            else {
                cout << que.top() << endl;
                que.pop();
                if(not que2.empty()) {
                    que.push(que2.top());
                    que2.pop();
                }
            }
        }
    }
}