#define MOD_TYPE 2

#pragma region Macros

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

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-7;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

// k 番目に小さい値
template <typename T>
struct setk
{
  int k;
  priority_queue<T> L;
  priority_queue<T, vector<T>, greater<T>> R;

  setk() {}
  setk(int k) : k(k) {}

  void push(T a, bool R);
  void erase(T a, bool R);

  // 大きい方に入れたかどうかを返す
  bool insert(T a)
  {
    if (L.size() < k)
    {
      push(a, 0);
      L.push(a);
      return 0;
    }
    if (L.top() < a)
    {
      push(a, 1);
      R.push(a);
      return 0;
    }
    push(L.top(), 1);
    R.push(L.top());
    erase(L.top(), 0);
    L.pop();
    push(a, 0);
    L.push(a);
    return 1;
  }

  bool erasek()
  {
    if (L.size() < k)
      return 0;
    erase(L.top(), 0);
    L.pop();
    if (!R.empty())
    {
      push(R.top(), 0);
      L.push(R.top());
      erase(R.top(), 1);
      R.pop();
    }
    return 1;
  }

  bool exist() { return L.size() == k; }
  T get()
  {
    assert(exist());
    return L.top();
  }
};

template <typename T>
void setk<T>::push(T a, bool R)
{
}

template <typename T>
void setk<T>::erase(T a, bool R)
{
}

void solve()
{
  int q, k;
  cin >> q >> k;
  setk<ll> st(k);
  rep(qi, q)
  {
    int t;
    cin >> t;
    if (t == 1)
    {
      ll v;
      cin >> v;
      st.insert(v);
    }
    else
    {
      if (st.exist())
      {
        cout << st.get() << "\n";
        st.erasek();
      }
      else
      {
        cout << -1 << "\n";
      }
    }
  }
}

int main()
{
  solve();
}