#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=int(a);i<(int)(b);i++)
#define reps(i,n) for(int i=0;i<=(int)(n);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1e18;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

const int MAXN = 200010;
int bit[MAXN+1];

int sum(int i)
{
  int s = 0;
  while(i > 0){
    s += bit[i];
    i -= i & -i;
  }
  return s;
}

void add(int i, int x)
{
  while(i <= MAXN){
    bit[i] += x;
    i += i & -i;
  }
}

int search(int x)
{
  int l = 0, r = MAXN;
  while(r-l > 1){
    int m = (l+r)/2;
    if(sum(m) < x){
      l = m; 
    }else{
      r = m;
    }
  }
  return r;
}

int main()
{
  int q, k;
  cin >> q >> k;

  vl t(q), v;
  rep(i, q){
    cin >> t[i];
    if(t[i] == 1){
      ll vv;
      cin >> vv;
      v.pb(vv);
    }
  }

  vl V;
  foreach(vv, v){
    V.pb(vv);
  }

  sort(all(V));
  V.erase(unique(all(V)), V.end());

  map<ll, int> nv;
  foreach(vv, v){
    int nvv = lower_bound(all(V), vv) - V.begin();
    nv[vv] = nvv;
  }

  auto itv = v.begin();
  rep(i, q){
    if(t[i] == 1){
      add(nv[*itv]+1, 1);
      itv++; 
    }else{
      ll ans = search(k)-1;
      if(ans == MAXN-1) cout << -1 << endl;
      else cout << V[ans] << endl;
      add(ans+1, -1);
    }
  }

  return 0;
}