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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// find_by_order(int) -> iterator
// order_of_key(int) -> int

using namespace __gnu_pbds;

template<class T> using Set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class TKey, class TVal> using Map = tree<TKey, TVal, std::less<TKey>, rb_tree_tag, tree_order_statistics_node_update>;

using namespace std;

long long input() {
  long long t;
  scanf("%lld", &t);
  return t;
}

int main() {
  int q, K;
  cin >> q >> K;

  Set<pair<long long, int>> st;

  while (q--) {
    if (input() == 1) {
      st.insert({input(), q});
    } else {
      if (st.size() >= K) {
        auto it = st.find_by_order(K - 1);
        printf("%lld\n", it->first);
        st.erase(it);
      } else {
        puts("-1");
      }
    }
  }
}