mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.buffer.readline

    class Bit:
        def __init__(self, n):
            self.size = n
            self.tree = [0] * (n + 1)

        def sum(self, i):
            s = 0
            while i > 0:
                s += self.tree[i]
                i -= i & -i
            return s

        def add(self, i, x):
            while i <= self.size:
                self.tree[i] += x
                i += i & -i

        def lower_bound(self, w):
            if w <= 0:
                return 0
            x = 0
            k = 1 << (self.size.bit_length() - 1)
            while k:
                if x + k <= self.size and self.tree[x + k] < w:
                    w -= self.tree[x + k]
                    x += k
                k >>= 1
            return x + 1

    Q, K = map(int, input().split())
    query = []
    V = set()
    for _ in range(Q):
        line = list(map(int, input().split()))
        if line[0] == 1:
            V.add(line[1])
        query.append(line)

    V = sorted(list(V))
    v2i = {v: i+1 for i, v in enumerate(V)}
    i2v = {i+1: v for i, v in enumerate(V)}

    N = len(V)
    if N == 0:
        for _ in range(Q):
            print(-1)
        exit()
    bit = Bit(N)
    for q in query:
        if q[0] == 1:
            v = q[1]
            bit.add(v2i[v], 1)
        else:
            j = bit.lower_bound(K)
            if j == N+1:
                print(-1)
            else:
                print(i2v[j])
                bit.add(j, -1)


if __name__ == '__main__':
    main()