import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array;

void main() {
    int q, k;
    scan(q, k);

    import std.container;

    auto maxh = new BinaryHeap!(Array!long, "a < b")();
    auto minh = new BinaryHeap!(Array!long, "a > b")();

    foreach (i ; 0 .. q) {
        auto line = readln.split.to!(long[]);

        if (line[0] == 1) {
            if (maxh.length < k) {
                maxh.insert(line[1]);
            }
            else {
                if (maxh.front < line[1]) {
                    minh.insert(line[1]);
                }
                else {
                    minh.insert(maxh.front);
                    maxh.removeFront();
                    maxh.insert(line[1]);
                }
            }
        }
        else {
            if (maxh.length < k) {
                writeln(-1);
            }
            else {
                writeln(maxh.front);
                maxh.removeFront();
                if (!minh.empty) {
                    maxh.insert(minh.front);
                    minh.removeFront();
                }
            }
        }
    }
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}