#include <bits/stdc++.h>
using namespace std;
 
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e18
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<"\n";}
typedef long long ll;

template <class Abel>
struct BIT
{
    vector<Abel> dat;
    Abel UNITY_SUM = 0; // to be set

    /* [1, n] */
    BIT(int n) { init(n); }
    void init(int n)
    {
        dat.resize(n + 1);
        for (int i = 0; i < (int)dat.size(); ++i)
            dat[i] = UNITY_SUM;
    }

    /* a is 1-indexed */
    inline void add(int a, Abel x)
    {
        for (int i = a; i < (int)dat.size(); i += i & -i)
            dat[i] = dat[i] + x;
    }

    /* [1, a], a is 1-indexed */
    inline Abel sum(int a)
    {
        Abel res = UNITY_SUM;
        for (int i = a; i > 0; i -= i & -i)
            res = res + dat[i];
        return res;
    }

    /* [a, b), a and b are 1-indexed */
    inline Abel sum(int a, int b)
    {
        return sum(b - 1) - sum(a - 1);
    }

    /* k-th number (k is 0-indexed) */
    int get(long long k)
    {
        ++k;
        int res = 0;
        int N = 1;
        while (N < (int)dat.size())
            N *= 2;
        for (int i = N / 2; i > 0; i /= 2)
        {
            if (res + i < (int)dat.size() && dat[res + i] < k)
            {
                k = k - dat[res + i];
                res = res + i;
            }
        }
        return res + 1;
    }
};

signed main()
{
    int q, k;
    cin >> q >> k;
    vector<int> type(q);
    vector<int> ad;
    vector<int> V(q);
    for (int i = 0; i < q; i++)
    {
        int x;
        cin >> x;
        if(x==1){
            int u;
            cin >> u;
            type[i] = x;
            V[i] = u;
            ad.push_back(u);
        }
        else{
            type[i] = x;
        }
    }
    sort(ad.begin(), ad.end());
    set<int> st(ad.begin(), ad.end());
    vector<int> v(st.begin(), st.end());
    show(v);
    BIT<int> bit(200010);
    for (int i = 0; i < q; i++)
    {
        if(type[i]==1){
            int idx = lower_bound(ALL(v), V[i]) - v.begin();
            //cerr << idx << endl;
            idx++;

            bit.add(idx, 1);
        }
        else{
            int size = bit.sum(200010);
            if(k>size){
                cout << -1 << endl;
            }
            else{
            int id = bit.get(k - 1);
            //cerr << "id" << id << endl;
            cout << v[id - 1] << endl;
            bit.add(id, -1);
            }
        }
    }
    

    return 0;
}