#include <bits/stdc++.h>
#include<complex>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;

}
ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}

using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;


vector<mint> fact, factinv, inv, factK;
ll mod = 998244353;
void prenCkModp(ll n) {
    // factK.resize(4*n+5);
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
    // factK[0]=1;
    // for(ll i=1;i<4*n+5;i++){
    //    factK[i]=factK[i-1]*mint(K-i+1);
    //    //K*(K-1)*...*(K-i+1);
    // }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}
// ll K;
// mint nCkK(ll n,ll k){
//    if(K<n||K-n<k)return 0;
//    mint res=factK[n+k];
//    res*=factK[n].inv();
//    res*=factinv[k];
//    return res;
// }



template<class T>
struct K_small {
    ll K;
    T sum;
    multiset<T> small, big;
    K_small(ll _K) :K() {
        sum = e();
        K = _K;
    }

    // xを追加する. 小さい方に追加されたら1を返す.
    bool insert(T x) {
        if (ll(small.size()) < K) {
            small.insert(x);
            sum = op(sum, x);
            return 1;
        }
        else {
            if(K==0){
                big.insert(x);
                return 0;
            }

            auto sla = small.end();
            sla--;
            T sb = *sla;
            if (sb > x) {
                small.insert(x);
                small.erase(sla);
                big.insert(sb);
                sum = op(sum, x);
                sum = op(sum, inv(sb));
                return 1;
            }
            else {
                big.insert(x);
                return 0;
            }
        }
    }


    bool erase(T x) {
        auto se=small.find(x);
        auto gb=big.find(x);
        assert(se != small.end() || gb != big.end());
        
        if (gb != big.end()) {
            big.erase(gb);
            return 0;
        }
        else {
            small.erase(se);
            sum = op(sum, inv(x));
            if (ll(big.size()) == 0)return 0;
            else {
                auto bs = big.begin();
                T ad = *bs;
                big.erase(bs);
                small.insert(ad);
                sum = op(sum, ad);
                return 1;
            }
        }
    }

    void changeK(ll NK) {
        K = NK;
        assert(ll(small.size()) + ll(big.size()) >= K);
        while (ll(small.size()) < K) {
            auto p = big.begin();
            T ns = *p;
            sum = op(sum, ns);
            small.insert(ns);
            big.erase(p);
        }
        while (ll(small.size()) > K) {
            auto p = small.end();
            p--;
            T ns = *p;
            sum = op(sum, inv(ns));
            big.insert(ns);
            small.erase(p);
        }
        return;
    }

    T pr() {
        return sum;
    }

    void debug(){
        cout<<"small:";
        for(auto s:small)cout<<" "<<s;
        cout<<endl;
        cout<<"big:";
        for(auto b:big)cout<<" "<<b;
        cout<<endl<<endl;
    }

    T e() {
        return 0;
    }
    T op(T a, T b) {
        return a + b;
    }
    T inv(T a) {
        return -a;
    }
};


int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll Q,K;
    cin>>Q>>K;
    K_small<ll> P(K);
    rep(q,Q){
        ll t;
        cin>>t;
        if(t==2){
            if(P.small.size()==K){
                ll an=*(prev(P.small.end()));
                cout<<an<<endl;
                P.erase(an);
            }
            else cout<<-1<<endl;
        }
        else{
            ll x;
            cin>>x;
            P.insert(x);
        }
    }
}