#include <iostream>
#include <set>
using namespace std;
typedef long long LL;
int main(int argc, char* argv[])
{
	int Q,K;
	cin>>Q>>K;
	int type;
	LL v;
	int i;
	multiset<LL> query;
	multiset<LL>::iterator sit;
	string s;
	for (i=0;i<Q;i++){
		cin>>type;
		if (type==1){
			cin>>v;
			query.insert(multiset<LL>::value_type(v));
		}else if (type==2){
			int n=1;
			if (query.size()>=K){
				for (sit=query.begin();sit!=query.end();sit++,n++){
					if (n==K){
						cout<<*sit<<endl;
						query.erase(sit);
						break;
					}
				}
			}else{
				cout<<-1<<endl;
			}
		}
	}
	return 0;
}