#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;

const int MAX_V = 200100;

class BIT {
public:
    // 要素数N、値vで初期化
    explicit BIT(int N, int v) : V_NUM(N) {
        fill(data, data + V_NUM + 1, v);
    }

    // [1, i]の総和を求める
    int query(int i) {
        ll ret = 0;
        while (i > 0) {
            ret += data[i];
            i -= (i & -i);
        }
        return ret;
    }

    // data[i]にv可算
    void update(int i, int v) {
        while (i < V_NUM) {
            data[i] += v;
            i += (i & -i);
        }
    }

    int V_NUM;
    int data[MAX_V];
};

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

    ll val[Q];
    vector<ll> v = {-1};
    // BITが1-indexedなので、その調整用

    for (int i = 0; i < Q; ++i) {
        int q;
        cin >> q;
        if (q == 1) {
            cin >> val[i];
            v.push_back(val[i]);
        } else {
            val[i] = -1;
        }
    }

    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());

    map<ll, int> dic;
    int idx = 0;
    for (ll c : v) {
        dic[c] = idx;
        ++idx;
    }
    // [1, idx)まで値が入っている

    BIT bit(idx, 0);
    for (int i = 0; i < Q; ++i) {
        if (val[i] >= 0) {
            bit.update(dic[val[i]], 1);
        } else {
            // i <= ok <=> bit[i] <= K
            int ok = 0, ng = idx;
            while (ng - ok > 1) {
                int mid = (ok + ng) / 2;
                if (bit.query(mid) < K) {
                    ok = mid;
                } else {
                    ng = mid;
                }
            }

            if (ng == idx) {
                cout << -1 << endl;
            } else {
                cout << v[ng] << endl;
                bit.update(ng, -1);
            }
        }
    }

    return 0;
}