#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl

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

    // input
    ll Q, K;
    cin >> Q >> K;

    priority_queue<ll> que; // 大きい順
    priority_queue<ll, vector<ll>, greater<ll> > que2; // 小さい順

    FOR(i, 0, Q){
        ll id;
        cin >> id;

        if(id==1){
            ll v;
            cin >> v;
            que.push(v);
            if(que.size()>K){
                ll a = que.top();
                que.pop();
                que2.push(a);
            }
        }
        else{
            if(que.size()<K){
                p(-1);
            }else{
                ll a = que.top();
                que.pop();
                p(a);

                if(que2.size()>0){
                    ll b = que2.top();
                    que2.pop();
                    que.push(b);
                }
            }
        }
    }
    
    return 0;
}