#include<bits/stdc++.h>
using namespace std;
using Int = long long;

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
template <typename T>
using gtree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
// usage:
// find_by_order(Int k): return the iterator of k-th smallest element (0-indexed)
// order_of_key(T key):  return the index of key in tree

//INSERT ABOVE HERE
signed main(){
  Int q,k;
  cin>>q>>k;
  using P = pair<Int,Int>;
  gtree<P> g;
  for(Int i=0;i<q;i++){
    Int t;
    cin>>t;
    if(t==1){
      Int x;
      cin>>x;
      g.insert(P(x,i));
    }
    if(t==2){
      if((Int)g.size()<k){
	cout<<-1<<endl;
	continue;
      }
      P v=*g.find_by_order(k-1);
      cout<<v.first<<endl;
      g.erase(v);
    }
  }
  
  return 0;
}