#include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;


template<typename T>
class SegmentTree {
private:
	using F = function<T(T, T)>; // モノイド型
	int n; // 横幅
	F f;   // モノイド
	T e;   // モノイド単位元
	vector<T> data;

public:
	// init忘れに注意
	SegmentTree() {}
	SegmentTree(F f, T e) :f(f), e(e) {}
	void init(int n_) {
		n = 1;
		while (n < n_)n <<= 1;
		data.assign(n << 1, e);
	}
	void build(const vector<T>& v) {
		int n_ = v.size();
		init(n_);
		rep(i, n_)data[n + i] = v[i];
		for (int i = n - 1; i >= 0; i--) {
			data[i] = f(data[(i << 1) | 0], data[(i << 1) | 1]);
		}
	}
	void set_val(int idx, T val) {
		idx += n;
		data[idx] = val;
		while (idx >>= 1) {
			data[idx] = f(data[(idx << 1) | 0], data[(idx << 1) | 1]);
		}
	}
	T query(int a, int b) {
		// [a,b)
		T vl = e, vr = e;
		for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
			if (l & 1)vl = f(vl, data[l++]); // unknown
			if (r & 1)vr = f(data[--r], vr); // unknown
		}
		return f(vl, vr);
	}
};

int main()
{
	// input
	ll Q, K;
	cin >> Q >> K;
	vector<pair<ll, ll>> querys(Q);
	rep(i, Q) {
		ll type, v = 0;
		cin >> type;
		if (type == 1)cin >> v;
		querys[i] = { type,v };
	}

	// offline query's compression
	set<ll> st;
	for (const auto& query : querys)
		if (query.first == 1)
			st.insert(query.second);
	map<ll, ll> trans, rev;
	ll cnt = 0;
	for (auto& num : st) {
		trans[num] = cnt;
		rev[cnt] = num;
		cnt++;
	}

	// segment tree init
	auto f = [](ll a, ll b) {return a + b; };
	SegmentTree<ll> seg(f, 0);
	seg.init(cnt);

	// query
	for (auto& query : querys) {
		ll type, v;
		tie(type, v) = query;
		if (type == 1) {
			ll pos = trans[v];
			ll num = seg.query(pos, pos + 1);
			seg.set_val(pos, num + 1);
		}
		else {
			if (seg.query(0, cnt) < K) {
				//cerr << "debug";
				cout << -1 << endl;
				continue;
			}

			// binary search
			ll out = -1, safe = cnt - 1;
			while (abs(safe - out) > 1) {
				ll mid = (out + safe) / 2;
				(seg.query(0, mid + 1) >= K ? safe : out) = mid;
			}
			//cerr << "debug";
			cout << rev[safe] << endl;
			ll num = seg.query(safe, safe + 1);
			assert(num > 0);
			seg.set_val(safe, num - 1);
		}
	}

	return 0;
}