#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define sz(a) int((a).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(c) c.begin(), c.end()
#define tr(container, it) for(auto it = container.begin(); it != container.end(); it++)
#define ZEROS(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,-1,sizeof(a))

using namespace std;

typedef std::pair< int,int > P;
typedef long long ll;


int main() {
    priority_queue<ll, vector<ll> > small;
    priority_queue<ll, vector<ll>, greater<ll> > large;

    int Q, K;
    cin >> Q >> K;
    rep(i, Q) {
        int q;
        cin >> q;
        if (q == 1) {
            ll v;
            cin >> v;
            if (small.size() < K) {
                small.push(v);
            } else {
                if (small.top() > v) {
                    large.push(small.top());
                    small.pop();
                    small.push(v);
                } else {
                    large.push(v);
                }
            }
        } else {
            if (small.size() < K) {
                cout << -1 << endl;
            } else {
                cout << small.top() << endl;
                small.pop();
                if (!large.empty()) {
                    small.push(large.top());
                    large.pop();
                }   
            }
        }
    }
}