#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

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

  vector<ll> nums;
  for (int i = 0; i < Q; ++i) {
    int type;
    ll v;
    cin >> type;

    if (type == 1) {
      cin >> v;
      int idx = upper_bound(nums.begin(), nums.end(), v) - nums.begin();
      nums.insert(nums.begin() + idx, v);
    } else {
      if (nums.size() < K) {
        cout << -1 << endl;
      } else {
        cout << nums[K - 1] << endl;
        nums.erase(nums.begin() + K - 1);
      }
    }
  }

  return 0;
}