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

template<typename Abel> struct BIT {
    int sz;
    vector<Abel> dat;
    BIT(int n, Abel UNITY_SUM = 0) : sz(n + 1), dat(sz, UNITY_SUM) { }  // [1, n]
    inline void add(int i, Abel x) {
        while (i < dat.size()) { dat[i] += x; i += i & -i; }
    }
    inline Abel sum(int i) {    // [1, i]
        Abel res = dat[0];
        while (i > 0) { res += dat[i]; i -= i & -i; }
        return res;
    }
    inline Abel sum(int a, int b) { return sum(b - 1) - sum(a - 1); }   // [a, b)
    int lower_bound(long long w) {
        if (w <= 0) return 0;
        int idx = 0, r = 1; while (r < sz) r <<= 1;
        for (int k = r >> 1; k > 0; k >>= 1) {
            if (idx + k < sz && dat[idx + k] < w) w -= dat[idx += k];
        }
        return idx + 1;
    }
    Abel operator[](int i) { return sum(i, i + 1); }
    friend ostream& operator<<(ostream& os, BIT<Abel> &bit) {
        for (int i = 1; i < bit.sz; i++) os << bit[i] << " ";
        return os;
    }
};

template<typename T> struct Compress1D {
    map<T, int> zip; vector<T> unzip; int sz;
    Compress1D(vector<T> a) {
        sort(begin(a), end(a)); a.erase(unique(begin(a), end(a)), end(a));
        sz = a.size(); unzip.resize(sz);
        for (int i = 0; i < sz; i++) zip[a[i]] = i, unzip[i] = a[i];
    }
    int operator[](T x) { return zip[x]; }
    T inv(int idx) { return unzip[idx]; }
    int size() { return sz; }
};

int main() {
    int q, k; cin >> q >> k;
    vector<long long> vals, v(q);
    vector<int> t(q);
    for (int i = 0; i < q; i++) {
        cin >> t[i];
        if (t[i] == 1) cin >> v[i], vals.emplace_back(v[i]);
    }
    Compress1D<long long> idx(vals);
    BIT<int> bit(idx.size());
    for (int i = 0; i < q; i++) {
        if (t[i] == 1) {
            bit.add(idx[v[i]] + 1, 1);
        } else {
            int size = bit.sum(idx.size());
            if (k > size) {
                cout << -1 << endl;
            } else {
                int val = bit.lower_bound(k);
                cout << idx.inv(val - 1) << endl;
                bit.add(val, -1);
            }
        }
    }
    return 0;
}