#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    priority_queue<ll,vector<ll>,greater<ll>> pq2;
    priority_queue<ll> pq;
    int q,k;cin >> q >> k;
    while(q--){
        int x;cin >> x;
        if(x==1){
            ll v;cin >> v;
            if(pq.size()<k){
                pq.push(v);
            }
            else{
                if(v<pq.top()){
                    ll p=pq.top();
                    pq.pop();
                    pq.push(v);
                    pq2.push(p);
                }
                else{
                    pq2.push(v);
                }
            }
        }
        else{
            if(pq.size()<k){
                cout << -1 << endl;
            }
            else{
                cout << pq.top() << endl;
                pq.pop();
                if(!pq2.empty()){
                    ll p=pq2.top();
                    pq2.pop();
                    pq.push(p);
                }
            }
        }
    }
}