#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>
typedef long long int lint;

using namespace std;
#define INF 1000000000000000005
int main()
{
lint q,k;
std::cin >> q >> k;
multiset<lint> query;
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;
        query.insert(v);
        index++;
    } else {
        if(index >= k){
            auto itr = query.begin();
            if(k <= q/2){
                std::advance(itr,k - 1);
            } else {
                itr = query.end();
                std::advance(itr,index - k);
            }
            std::cout << *itr << std::endl;
            query.erase(itr);
            index--;
        } else {
            std::cout << -1 << std::endl;
        }
    }
}
return 0;
}