#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int Q,K;
multiset<int> before, after;

void solve() {
    cin>>Q>>K;
    int t,v;
    while(Q--) {
        cin>>t;
        if (t==1) {
            cin>>v;
            auto lastit = before.end();
            lastit--;
            int last = (*lastit);
            if (before.size() < K) {
                before.insert(v);
            } else if (v >= last) {
                after.insert(v);
            } else {
                after.insert(last);
                before.erase(lastit);
                before.insert(v);
            }
        }
        else {
            if (before.size() == K) {
                auto it = before.end();
                it--;
                cout << (*it) << endl;
                before.erase(it);
                if (after.size()) {
                    before.insert(*after.begin());
                    after.erase(after.begin());
                }
            } else {
                cout << -1 << endl;
            }
        }
    }
    
    //cout << ans << endl;
}