#include<bits/stdc++.h>
using namespace std;
using ll=long long;
struct bit{
    int N;
    int v[200008];
    void add(int a,int w){
        for(int x=a;x<=N;x+=x&-x)v[x]+=w;
    }
    ll sum(int a){
        ll rtn=0;
        for(int x=a;x>0;x-=x&-x)rtn+=v[x];
        return rtn;
    }
    ll prod(int a,int b){
        return sum(b)-sum(a-1);
    }
};
int main(){
    int Q,K;
    cin>>Q>>K;
    vector<ll> v;
    vector<pair<int,ll>> qry(Q);
    for(int i=0;i<Q;i++){
        int t;cin>>t;
        qry[i].first=t;
        if(t==1){
            ll va;
            cin>>va;
            qry[i].second=va;
            v.push_back(va);
        }
    }
    vector<ll> c=v;
    sort(c.begin(),c.end());
    c.erase(unique(c.begin(),c.end()),c.end());
    for(int i=0;i<v.size();i++){
        v[i]=lower_bound(c.begin(),c.end(),v[i])-c.begin();
    }
    bit BIT;
    BIT.N=c.size()+1;
    int coun=0;
    for(int i=0;i<Q;i++){
        auto [t,val]=qry[i];
        if(t==1){
            int pos=v[coun++];
            BIT.add(pos,1);
        }else{
            if(BIT.sum(BIT.N-1)<K){
                cout<<-1<<"\n";
            }else{
                int wa=0,ac=BIT.N-1;
                while(wa!=ac){
                    int mid=(wa+ac)/2;
                    if(BIT.sum(mid)<K){
                        wa=mid+1;
                    }else{
                        ac=mid;
                    }
                }
                BIT.add(ac,-1);
                cout<<c[ac]<<"\n";
            }
        }
    }
    return 0;
}