#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  tree<pair<long, int>, null_type, less<pair<long, int>>, rb_tree_tag, tree_order_statistics_node_update> T;
  int Q, K;
  cin >> Q >> K;
  int id = 0;
  while (Q--) {
    int q;
    cin >> q;
    if (q == 1) {
      long v;
      cin >> v;
      T.insert({v, id++});
    } else {
      if (T.size() < K) {
        cout << -1 << "\n";
        continue;
      }
      auto a = T.find_by_order(K - 1);
      cout << a -> first << "\n";
      T.erase(a);
    }
  }
}