#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

class BIT {
private:
	ll N;
	vector<ll> node;
public:
	BIT(ll M) {
		node = vector<ll>(M + 1, 0);
		N = M;
	}

	ll sum(ll i) {
		ll s = 0;
		while (i > 0) {
			s += node[i];
			i -= i & -i;
		}
		return s;
	}

	ll sum(ll i, ll j) {
		ll l = sum(i - 1);
		ll r = sum(j);
		return r - l;
	}

	void add(ll i, ll x) {
		while (i <= N) {
			node[i] += x;
			i += i & -i;
		}
	}
};



int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll Q, K; scanf("%lld %lld", &Q, &K);
	map<ll, ll> mp;
	vector<pair<ll, ll>> vp(Q);
	vector<ll> cnv(Q + 5);
	for(ll i = 0; i < Q; i++) {
		ll q; scanf("%lld", &q);
		if (q == 1) {
			ll x; scanf("%lld", &x);
			vp[i] = make_pair(q, x);
			mp[x] = 0;
		}
		else {
			vp[i] = make_pair(q, 0);
		}
	}
	{
		ll id = 1;
		for (auto itr = mp.begin(); itr != mp.end(); itr++) itr->second = id++;
		for (auto p : mp) cnv[p.second] = p.first;
		for (ll i = 0; i < Q; i++) if (vp[i].first == 1) vp[i].second = mp[vp[i].second];
	}
	BIT bit(Q + 5);
	for (ll i = 0; i < Q; i++) {
		if (vp[i].first == 1) {
			bit.add(vp[i].second, 1);
		}
		else {
			if (bit.sum(Q + 3) < K) puts("-1");
			else {
				ll left = 0;
				ll right = Q + 3;
				while (right - left > 1) {
					ll mid = (left + right) >> 1;
					if (bit.sum(mid) >= K) right = mid;
					else left = mid;
				}
				bit.add(right, -1);
				printf("%lld\n", cnv[right]);
			}
		}
	}
	return 0;
}