#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

namespace algebra {

template < class T > class PLUS {
  public:
    using set = T;
    static constexpr T op(const T &l, const T &r) { return l + r; }
    static constexpr T id = T(0);
    static constexpr T inv(const T &x) { return -x; }
    static constexpr T pow(const T &x, const int n) { return x * n; }
    static constexpr bool comm = true;
};
  
}

template < class comm_monoid > class fenwick_tree {
  public:
    using T = typename comm_monoid::set;

  private:
    int n, n2;
    vector< T > data;

    int ceil_pow2(int n) {
        int x = 1;
        while(x < n) x <<= 1;
        return x;
    }

  public:
    fenwick_tree() : fenwick_tree(0) {}
    fenwick_tree(int n) : n(n), n2(ceil_pow2(n)), data(n + 1, comm_monoid::id) { assert(comm_monoid::comm); }
    fenwick_tree(const vector< T > &a) : n(a.size()), n2(ceil_pow2(n)), data(a) {
        assert(comm_monoid::comm);
        data.insert(data.begin(), {comm_monoid::id});
        for(int i = 1; i <= n; i++) {
            int p = i + (i & -i);
            if(p <= n) data[p] = comm_monoid::op(data[i], data[p]);
        }
    }

    void add(int i, T x) {
        for(int p = i + 1; p <= n; p += p & -p) data[p] = comm_monoid::op(data[p], x);
    }
    // [0, r)
    T fold(int r) {
        T s = comm_monoid::id;
        for(int p = r; p > 0; p -= p & -p) s = comm_monoid::op(data[p], s);
        return s;
    }
    // [l, r)
    T fold(int l, int r) {
        return comm_monoid::op(comm_monoid::inv(fold(l)), fold(r));
    }
    T get(int i) {
        return fold(i, i + 1);
    }
    void set(int i, T x) {
        add(i, comm_monoid::op(comm_monoid::inv(get(i)), x));
    }
    template< class func > int search(const func &f) {
        T s = comm_monoid::id;
        if(f(s)) return 0;
        int i = 0, k = n2;
        while(k >>= 1) {
            int p = i | k;
            if(p <= n && !f(comm_monoid::op(s, data[p]))) s = comm_monoid::op(s, data[i = p]);
        }
        return i;
    }
};

template < class T, class U > class offline_multiset {
  private:
    int n;
    U sz;
    vector< T > v;
    fenwick_tree< algebra::PLUS< U > > ft;

  public:
    offline_multiset() {}
    offline_multiset(const vector< T > &x) : v(x) {
        sort(v.begin(), v.end());
        v.erase(unique(v.begin(), v.end()), v.end());
        n = v.size();
        sz = U(0);
        ft = fenwick_tree< algebra::PLUS< U > >(n);
    }

    void insert(T x, U cnt = 1) {
        int i = lower_bound(v.begin(), v.end(), x) - v.begin();
        assert(v[i] == x);
        ft.add(i, +cnt); sz += cnt;
    }
    void erase(T x, U cnt = 1) {
        int i = lower_bound(v.begin(), v.end(), x) - v.begin();
        assert(v[i] == x);
        ft.add(i, -cnt); sz -= cnt;
    }
    T get_kth(U k) {
        return v[ft.search([k](U s){ return s >= k; })];
    }
    U size() const {
        return sz;
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll Q,K; cin >> Q >> K;
    vector<pair<ll,ll>> query(Q);
    vector<ll> x;
    for(auto &[t, v] : query) {
        cin >> t;
        if(t == 1) {
            cin >> v;
            x.push_back(v);
        }
    }
    offline_multiset<ll,ll> st(x);
    for(auto &[t, v] : query) {
        if(t == 1) {
            st.insert(v);
        } else {
            if(K <= st.size()) {
                ll x = st.get_kth(K);
                cout << x << "\n";
                st.erase(x);
            } else {
                cout << -1 << "\n";
            }
        }
    }
}