#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <vector>
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;
    }

    vector<long long> v;
    for(int i = 0; i < q; i++)
    {
        if(a[i]==1)
        {
            v.push_back(b[i]);
        }
        else if(a[i]==2)
        {
            if(v.size() < k)
                cout << -1 <<endl;
            else
            {
                sort(v.begin(),v.end());
                cout << v[k-1] << endl;
                v.erase(v.begin()+k-1);
            }
        }       
    }

    return 0;
}