#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <utility>
#include <algorithm>
#include <functional>
#include <deque>
#define INF 1e9

using namespace std;

typedef long long ll;
typedef pair<int,int> P;

ll my_remove(vector<ll> &s, int i) {
    ll res = s[i];
    s.erase(s.begin() + i);
    return res;
}

int main() {
    int Q, K;
    cin >> Q >> K;
    vector<ll> S;
    for (int i = 0; i < Q; ++i) {
        int a; ll b;
        scanf("%d", &a);
        if (a == 1) {
            scanf("%lld", &b);
            S.push_back(b);
            sort(S.begin(), S.end());
        } else {
            if (S.size() >= K) {
                ll res = my_remove(S, K);
                printf("%lld", res);
            } else {
                printf("%d", -1);
            }
        }
    }
    
    return 0;
}