#include<atcoder/all>
using namespace atcoder;
#include<bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fin(a) {pt(a);return 0;}
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
template<class T>T popcnt(T a){return __builtin_popcountll(a);}
template<class T>using ascending_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>using descending_priority_queue=priority_queue<T>;
template<class T>bool chmax(T&a,const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,const T&b){if(b<a){a=b;return 1;}return 0;}
template<typename V,typename T>T max(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmax(r,max(v,id));return r;}
template<typename V,typename T>T min(vector<V>&vec,const T&id){T r=id;for(auto&v:vec)chmin(r,min(v,id));return r;}
istream&operator>>(istream&is,modint1000000007&x){unsigned int t;is>>t;x=t;return is;}
istream&operator>>(istream&is,modint998244353&x){unsigned int t;is>>t;x=t;return is;}
istream&operator>>(istream&is,modint&x){unsigned int t;is>>t;x=t;return is;}
ostream&operator<<(ostream&os,const modint1000000007&x){os<<x.val();return os;}
ostream&operator<<(ostream&os,const modint998244353&x){os<<x.val();return os;}
ostream&operator<<(ostream&os,const modint&x){os<<x.val();return os;}
template<class T1,class T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<class T1,class T2>ostream&operator<<(ostream&os,const pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<class T>istream&operator>>(istream&is,vector<T>&v){for(T&x:v)is>>x;return is;}
template<class T>ostream&operator<<(ostream&os,const vector<T>&v){for(int i=0;i<(int)v.size();i++){os<<v[i]<<(i+1==v.size()?"":" ");}return os;}
template<class...A>void pt_rest(){cout<<'\n';}
template<class...A>void pt(){cout<<'\n';}
template<class T,class...A>void pt_rest(const T&first,const A&...rest){cout<<" "<<first;pt_rest(rest...);}
template<class T,class...A>void pt(const T&first,const A&...rest){cout<<first;pt_rest(rest...);}
template<typename V,typename H>void resize(vector<V>&vec,const H head){vec.resize(head);}
template<typename V,typename H,typename...T>void resize(vector<V>&vec,const H&head,const T...tail){vec.resize(head);for(auto&v:vec)resize(v,tail...);}
template<typename V,typename T>void fill(V&x,const T&val){x=val;}
template<typename V,typename T>void fill(vector<V>&vec,const T&val){for(auto&v:vec)fill(v,val);}
template<typename H>void vin(istream&is,const int idx,vector<H>&head){is>>head[idx];}
template<typename H,typename...T>void vin(istream&is,const int idx,vector<H>&head,T&...tail){vin(is>>head[idx],idx,tail...);}
template<typename H,typename...T>void vin(istream&is,vector<H>&head,T&...tail){for(int i=0;i<(int)head.size();i++)vin(is,i,head,tail...);}
template<typename H,typename...T>void vin(vector<H>&head,T&...tail){vin(cin,head,tail...);}
void divisor(ll n,map<ll,ll>&div){for(ll i=1;i*i<=n;i++)if(n%i==0){div[i]++;div[n/i]++;}}
void factrization(ll n,map<ll,ll>&fact){for(ll i=2;i*i<=n;i++)while(n%i==0){fact[i]++;n/=i;}if(n>1)fact[n]++;}
ll lsqrt(ll x){ll r=sqrt(x)-1;while((r+1)<=x/(r+1))r++;return r;};
ll inf=1e18+7;
ld pi=acos(-1);
ld eps=1e-10;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
using v4=vector<v3>;
using S=ll;
S op(S a,S b){return a+b;}
S e(){return 0;}

v1 compress(v1&C){
  v1 res;
  ll n=C.size();
  for(ll i=0;i<n;i++)for(ll d=0;d<1;d++)res.push_back(C[i]+d);
  sort(all(res));
  res.erase(unique(all(res)),res.end());
  for(ll i=0;i<n;i++)C[i]=lower_bound(all(res),C[i])-res.begin();
  return res;
}

ll Q,K;
bool f(S x){return x<K;}

int main(void){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  cin>>Q>>K;
  v1 v(Q,inf);
  for(ll i=0;i<Q;i++){
    ll _;cin>>_;
    if(_==1)cin>>v[i];
  }
  
  v1 val=compress(v);
  segtree<S,op,e>seg(vector<S>(val.size(),0));
  for(ll i=0;i<Q;i++){
    if(val[v[i]]<inf){
      seg.set(v[i],seg.get(v[i])+1);
    }else{
      if(seg.all_prod()<K)pt(-1);
      else{
        ll k=seg.max_right<f>(0);
        seg.set(k,seg.get(k)-1);
        pt(val[k]);
      }
    }
  }
}