#include<iostream>
#include<vector>
#include<string>
#include<array>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<numeric>
#include<iomanip>
#include<utility>
#include<cstdlib>
#include<typeinfo>
#include<functional>
typedef long long int lint;

using namespace std;
#define INF 1000000000000000005
int main()
{
lint q,k;
std::cin >> q >> k;
priority_queue<lint> lquery;
priority_queue<lint,std::vector<lint>,std::greater<lint>> squery;
lint index = 0;
for(lint i = 0; i < q; i++){
    lint temp = 0;
    std::cin >> temp;
    if(temp == 1){
        lint v = 0;
        std::cin >> v;
        if(index < k){
            lquery.push(v);
            index++;
        } else {
            lint q = lquery.top();
            if(q > v){
                squery.push(q);
                lquery.pop();
                lquery.push(v);
                index++;
            } else {
                squery.push(v);
                index++;
            }
        }
    } else {
        if(index >= k){
            lint out = lquery.top();
            std::cout << out << std::endl;
            lquery.pop();
            if(index > k){
                lquery.push(squery.top());
                squery.pop();
                index--;
            } else {
                index--;
            }
        } else {
            std::cout << -1 << std::endl;
        }
    }
}
return 0;
}