#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int bit[200001], n;
 
int sum(int i){
	int s=0;
	while(i>0){
		s+=bit[i];
		i-=(i&(-i));
	}
	return s;
}
 
void add(int i, int x){
	while(i<=n){
		bit[i]+=x;
		i+=(i&(-i));
	}
}

int main()
{
	int q, k;
	cin>>q>>k;
	ll v[200000];
	set<ll> st;
	for(int i=0; i<q; i++){
		int t;
		cin>>t;
		if(t==2){
			v[i]=-1;
		}else{
			ll v0;
			cin>>v0;
			v[i]=v0;
			st.insert(v0);
		}
	}
	n=1;
	map<ll, int> mp;
	ll inv[200001];
	for(auto x:st){
		mp[x]=n;
		inv[n]=x;
		n++;
	}
	n--;
	for(int i=0; i<q; i++){
		if(v[i]>=0){
			add(mp[v[i]], 1);
		}else{
		    if(sum(n)<k){
		        cout<<-1<<endl;
		    }else{
			    int x1=1, x2=n;
			    while(x1!=x2){
				    int x=(x1+x2+1)/2;
				    if(sum(x-1)<k){
				    	x1=x;
				    }else{
				    	x2=x-1;
				    }
			    }
			    cout<<inv[x1]<<endl;
			    add(x1, -1);
		    }
		}
	}
	return 0;
}