#include<iostream>
#include<vector>
#include<algorithm>

#define QMAX 200000
#define NO ((1<<18) + 1)

using namespace std;

int main(){
    vector<long long> ve;
    int Q,K;
    int q;
    long long v;

    cin>>Q>>K;
    for(int i=0;i<Q;i++){
        cin>>q;
        if(q==1){
            cin>>v;
            ve.push_back(v);
        }
        else{
            sort(ve.begin(),ve.end());
            if(ve.size()<K||ve[K-1]==NO) cout<<"-1"<<endl;
            else{
                cout<<ve[K-1]<<endl;
                ve[K-1]=NO;
            }
        }
    }
}