#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cmath>
#include <complex>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include <iomanip>
using namespace std;

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define bitcnt(x) __builtin_popcount(x)
#define fst first
#define snd second
#define Pqaz(T) priority_queue<T,vector<T>,greater<T>>
#define Pqza(T) priority_queue<T>
#define put(x) cout << x;
#define putsp(x) cout << x << ' ';
#define putbd cout << "---------------------------------------------" << endl;
#define putln(x) cout << x << endl;
#define debug(x) cerr << #x << "=" << x << endl;
#define ENJYU std::ios::sync_with_stdio(false);std::cin.tie(0);
#define yuiyui 0

typedef long long ll;
typedef unsigned long long ul;
typedef pair<int, int> intP;
typedef pair<ll, ll> llP;
typedef pair<ul, ul> ulP;
typedef complex<double> comp;
typedef vector <int> vec;
typedef vector <ll> vecll;
typedef vector <ul> vecul;
typedef vector <double> vecd;
typedef vector <vec> mat;
typedef vector <vecll> matll;
typedef vector <vecul> matul;
typedef vector <vecd> matd;

//vector の中身を出力
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}

const int MAX = 200020;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const ll INFL = 1e18;
const ll MOD = 1e9+7;

const int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
//const int dx[]={-1,-1,-1,0,1,1,1,0},dy[]={-1,0,1,1,1,0,-1,-1};

//********************************template END****************************************//

template<typename T>
struct BIT
{
	int N, K;
	vector<T> bit;

	BIT (int X)
	{
		bit = vector<T>(X+1, 0);
		N = X+1;
		K = pow(2, (int)(log(X)/log(2)));
	}

	void add(int idx, T w)
	{
		for (int x = idx; x <= N; x += x&-x)
		{
			bit[x] += w;
		}
	}

	T sum(int idx)
	{
		T res = 0;
		for (int x = idx; x > 0; x -= x&-x) res += bit[x];
		return res;
	}

	int lb(T w)
	{
		int k = K, idx = 0;

		while(k > 0)
		{
			if (idx + k <= N && w > bit[idx+k])
			{
				w -= bit[idx+k];
				idx += k;
			}
			k >>= 1;
		}

		return idx+1;
	}

	void chmax(int idx, T w)
	{
		for (int x = idx; x <= N; x += x&-x)
		{
			bit[x] = max(bit[x], w);
		}
	}


	T getmax(int idx)
	{
		T res = 0;
		for (int x = idx; x > 0; x -= x&-x) res = max(res, bit[x]);
		return res;
	}

};


void solve(void){

	int Q, K;
	ll q, x;
	scanf("%d%d\n", &Q, &K);
	vecll xs, qs;
	while(Q--)
	{
		scanf("%lld\n", &q);
		if (q==1)
		{
			scanf("%lld\n", &x);
			xs.pb(x);
			qs.pb(x);
		}
		else
		{
			qs.pb(-1);
		}
	}

	sort(all(xs));
	uniq(xs);
	int n = xs.size();

	BIT<int> bit(MAX);

	map<ll, int> mp;

	rep(n, i) mp[xs[i]] = i+1;

	int cnt = 0;

	for (ll q : qs)
	{
		if (q >= 0)
		{
			bit.add(mp[q], 1);
			cnt++;
		}
		else
		{
			if (cnt < K)
			{
				printf("-1\n");
				continue;
			}
			int idx = bit.lb(K);
			printf("%lld\n", xs[idx-1]);
			bit.add(idx, -1);
			cnt--;
		}
	}

}

int main(void)
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return yuiyui;
}