#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main() {
  priority_queue<ll> q1;
  priority_queue<ll, vector<ll>, greater<ll> > q2;
  ll n,k;
  ll c1 = 0;
  cin>>n>>k;
  rep(i,0,n){
    ll a;
    cin>>a;
    if(a==1){
      ll b;
      cin>>b;
      if(c1<k){
        c1++;
        q1.push(b);
      }
      else{
        ll c = q1.top();
        if(b<=c){
          q1.push(b);
          q2.push(q1.top());
          q1.pop();
        }
        else{
          q2.push(b);
        }
      }
    }
    else{
      if(c1<k){
        cout << -1 << endl;
      }
      else{
        cout << q1.top() << endl;
        q1.pop();
        if(!q2.empty()){
          q1.push(q2.top());
          q2.pop();
        }
        else{
          c1--;
        }
      }
    }
  }
  return 0;
}