#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

template<class V, int ME> class BIT {
public:
	V bit[1<<ME];
	V operator()(int e) {if(e<0) return 0;V s=0;e++;while(e) s+=bit[e-1],e-=e&-e; return s;}
	void add(int e,V v) { e++; while(e<=1<<ME) bit[e-1]+=v,e+=e&-e;}
};
BIT<int,20> bt;

int Q,K;
int A[202020];
ll V[202020];
vector<ll> C;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>Q>>K;
	C.push_back(-1);
	FOR(i,Q) {
		cin>>A[i];
		if(A[i]==1) {
			cin>>V[i];
			C.push_back(V[i]);
		}
	}
	sort(ALL(C));
	
	FOR(i,Q) {
		if(A[i]==1) {
			bt.add(lower_bound(ALL(C),V[i])-C.begin(),1);
		}
		else {
			x=0;
			if(bt(1<<18)<K) {
				cout<<-1<<endl;
			}
			else {
				for(j=18;j>=0;j--) {
					if(bt(x+(1<<j))<K) x+=1<<j;
				}
				cout<<C[x+1]<<endl;
				bt.add(x+1,-1);
			}
			
		}
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}