#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<ll,ll> P;
ll bit[500010];
class BIT{
public:
  ll n;
  BIT(){fill(bit,bit+500010,0);}
  void add(ll i,ll x){
    while(i<=n){
      bit[i]+=x;
      i+=i&-i;
    }
  }
  ll sum(ll i){
    ll s=0;
    while(i>0){
      s+=bit[i];
      i-=i&-i;
    }
    return s;
  }
};
BIT t=BIT();
vector<P> v;
ll c[222222],d[222222];
void Main() {
  ll T,k;
  cin >> T >> k;
  P a[T];
  rep(i,T) {
    cin >> a[i].F;
    if(a[i].F==1) {
      cin >> a[i].S;
      v.pb(P(a[i].S,i));
    } else a[i].S=k;
  }
  sort(all(v));
  rep(i,v.size()) {
    c[v[i].S]=i+1;
    d[i+1]=v[i].F;
  }
  t.n=v.size()+1;
  rep(i,T) {
    if(a[i].F==1) t.add(c[i],1);
    else {
      ll l=0,r=v.size()+1;
      while(l+1<r) {
        ll m=(l+r)/2;
        if(t.sum(m)<a[i].S) l=m;
        else r=m;
      }
      if(r==v.size()+1) pr(-1);
      else {
        pr(d[r]);
        t.add(r,-1);
      }
    }
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}