#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV int(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
//const double PI = M_PI;  
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

/*Coding Space*/
template<class T>
struct FT{
    vector<T> d;
    int top;
    FT(size_t n):d(n+1){top = 1; while(top < (int)d.size()) top <<= 1;}
    T sum(size_t i){T s{};for(++i;i>0;i-=i&-i)s+=d[i];return s;}
    T sum(size_t i,size_t j){return i?sum(j)-sum(i-1):sum(j);} //[l,r]
    void add(size_t i,T x){for(++i;i<d.size();i+=i&-i)d[i]+=x;}
    int lower_bound(T x){ // x以上となるような初めてのiをインデックスで返している。もし存在しなければd.size()が返る
      int ret = 0;
      for(int i = top >> 1; i > 0; i >>= 1){
        if(ret + i < (int)d.size() && d[ret + i] < x){
          x -= d[ret + i];
          ret += i;
        }
      }
      return (ret);
    }
};
map<ll,int> zip; // zipではない
map<int,ll> un_zip;
void zip_in(vector<ll>& a){
  for(auto i:a) zip[i] = 1;
  int cnt = 1;
  for(auto &p:zip){
    p.second = cnt++;
    un_zip[p.second] = p.first;
  }
  /*
  DEB;
  for(auto a: zip) SHOW(a.FST,a.SEC);
  for(auto a: un_zip) SHOW(a.FST,a.SEC);
  */
}

int main(){
  FT<int> ft(200002);
  int q,k; cin >> q >> k;
  vt<ll> in;
  using Q = tuple<int,ll>;
  vt<Q> que;
  rep(i,q){
    int ope; cin >> ope;
    if(ope == 1){
      ll v; cin >> v;
      in.pb(v);
      que.pb(Q{ope,v});
    }else{
      que.pb(Q{ope,-1});
    }
  }
  
  zip_in(in);
  
  for(auto QQ:que){
    ll a,b; tie(a,b) = QQ;
    if(a == 2){
      int ans = ft.lower_bound(k);
      cout << (ans != 200002?un_zip[ans]:-1) << endl;
      if(ans != 200002)  ft.add(ans,-1);
    }else{
      ft.add(zip[b],1);
    }
  }
}