#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>

using namespace std;

int main() {
	int q, k, type;
	long long v;
	cin >> q >> k;

	vector<long long> nums, ans;
	for (int i = 0; i < q; i++) {
		cin >> type;
		if (type == 1) {
			cin >> v;
			auto it = upper_bound(nums.begin(), nums.end(), v);
			nums.insert(it, v);
		} else {
			if (nums.size() < k) {
				ans.emplace_back(-1);
			} else {
				ans.emplace_back(nums[k - 1]);
				nums.erase(nums.begin() + k - 1);
			}
		}
	}

	for (auto x : ans) {
		cout << x << endl;
	}
	return 0;
}