import sys
input = sys.stdin.readline

q, k = map(int, input().split())
Q = []
V = []
for i in range(q):
    query = list(map(int, input().split()))
    if len(query) == 1:
        c = query[0]
        v = 0
    else:
        c, v = query
        V.append(v)
    Q.append((c, v))

V = list(set(V))
V.sort()
toid = {}
import bisect
for v in V:
    toid[v] = bisect.bisect_left(V, v)+1

n = len(V)
bit = [0]*(n+1)

def bit_query(i):
    res = 0
    while i > 0:
        res += bit[i]
        i -= i & (-i)
    return res

def bit_update(i, x):
    while i <= n:
        bit[i] += x
        i += i & (-i)

def ok(i):
    if i <= 0:
        return False
    else:
        return bit_query(i) >= k

for i in range(q):
    c, v = Q[i]
    if c == 1:
        id = toid[v]
        bit_update(id, 1)
    else:
        if bit_query(n) < k:
            print(-1)
        else:
            l = 0
            r = n
            while l+1 < r:
                mid = (l+r)//2
                if ok(mid):
                    r = mid
                else:
                    l = mid
            print(V[r-1])
            bit_update(r, -1)