#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q,k; cin >> q >> k;
    priority_queue<ll> pq1;
    priority_queue<ll ,vector<ll>,greater<ll>> pq2;
    while(q--){
        int t; cin >> t;
        if(t == 1){
            ll v; cin >> v;
            pq1.push(v);
            while(pq1.size() > k){
                pq2.push(pq1.top());
                pq1.pop();
            }
        }
        else{
            if(pq1.size() < k){
                cout << -1 << "\n";
            }
            else{
                cout << pq1.top() << "\n";
                pq1.pop();
                while(pq2.size() and pq1.size() < k){
                    pq1.push(pq2.top());
                    pq2.pop();
                }
            }
        }
    }
}