#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <queue>
using namespace std;

int main(void)
{
    int q, k;
    cin >> q >> k;
    int a[q];
    long long b[q];

    for (int i = 0; i < q; i++)
    {
        cin >> a[i];
        if (a[i] == 1)
            cin >> b[i];
        else
            b[i] = -1;
    }

    priority_queue<long long> q1;
    priority_queue<long long, vector<long long>, greater<long long> > q2;
    for (int i = 0; i < q; i++)
    {
        if (a[i] == 1)
        {
            if (q1.size() < k)
                q1.push(b[i]);
            else
            {
                if (q1.top() > b[i])
                {
                    q2.push(q1.top());
                    q1.pop();
                    q1.push(b[i]);
                }
                else
                {
                    q2.push(b[i]);
                }
            }
        }
        else if (a[i] == 2)
        {
            if (q1.size() < k)
                cout << -1 << endl;
            else
            {
                cout << q1.top() << endl;
                q1.pop();
                if (q2.size() >= 1)
                {
                    q1.push(q2.top());
                    q2.pop();
                }
            }
        }
    }

    return 0;
}