#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}

const int MAX_N = 500005;
int bit[MAX_N+1];
int nn = MAX_N; //　1-index

void adds(int a, int w){
    for(int x = a; x <= nn; x += x & -x) bit[x] += w;
}
int sums(int a){ // bit[1,a]の和を返す.
    int ret = 0;
    for(int x = a; x > 0; x -= x & -x) ret += bit[x];  
    return ret;
}

int main() {
    int Q,K;
    cin >> Q >> K;
    int a[Q];
    ll b[Q] = {};
    set<ll> se;
    rep(i,Q){
        cin >> a[i];
        if(a[i] == 1){
            cin >> b[i];
            se.insert(b[i]);
        } 
    }

    int m = se.size();
    map<ll,int> mp;
    int cnt = 0;
    ll val[m+1] = {};
    for(auto x : se){
        cnt++;
        mp[x] = cnt;
        val[cnt] = x;
    }

    int now = 0;
    rep(i,Q){
        if(a[i] == 1){
            adds(mp[b[i]], 1);
            now++;
        }else{
            if(now < K){
                cout << -1 << endl;
                continue;
            }
            if(sums(1) >= K){
                cout << val[1] << endl;
                adds(1,-1);
                now--;
                continue;
            }
            int l = 1;
            int r = 200005;
            while(l+1<r){
                int mid = (l+r)/2;
                if(sums(mid)>=K){
                    r = mid;
                }else{
                    l = mid;
                }
            }
            cout << val[r] << endl;
            adds(r,-1);
            now--;
        }
    }

    return 0;
}