#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int q,k;
multiset<ll> se1,se2;

void solve(){
  cin >> q >> k;
  rep(i,q){
    int s;cin >> s;
    if(s==1){
      ll t;cin >> t;
      if(se1.size()<k){
        se1.insert(t);
      }
      else{
        auto id=se1.end();id--;
        if((*id)>t){
          se2.insert((*id));
          se1.erase(id);
          se1.insert(t);
        }
        else{
          se2.insert(t);
        }
      }
    }
    else{
      if(se1.size()<k){
        cout << -1 << endl;
        continue;
      }
      auto id=se1.end();id--;
      cout << (*id) << endl;
      se1.erase(id);
      if(!se2.empty()){
        se1.insert(*(se2.begin()));
        se2.erase(se2.begin());
      }
    }
  }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}