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

//constant
const long long int inf = 1<<30;
const int N = 1e5+1;
const int M = 1e5+1;

//variable
int q,k;
priority_queue<long long int>s;
priority_queue<long long int, vector<long long int>, greater<long long int> > l;

//function


int main()
{
    cin>>q>>k;
    for(int i=0; i<q; i++){
        int que;
        cin>>que;
        if(que==1){
            long long int v;
            cin>>v;
            s.push(v);
            if(s.size()>k){
                long long int ob=s.top();
                l.push(ob);
                s.pop();
            }
        }
        if(que==2){
            if(s.size()<k){
                cout<<-1<<endl;
                continue;
            }

            cout<<s.top()<<endl;
            //cout<<'a'<<endl;
            s.pop();
            if(l.size()>0){
                long long int ob=l.top();
                //cout<<'b'<<endl;
                s.push(ob);
                l.pop();
            }
        }
    }

    return 0;
}