class SplayNode():
    def __init__(self, val):
        self.val = val
        self.par = None
        self.lt = None
        self.rt = None
        self.size = 1

class SplayTree():
    def __init__(self):
        self.size = 0
        self.root = None

    def update(self, node):
        node.size = 1
        if node.lt is not None:
            node.size += node.lt.size
        if node.rt is not None:
            node.size += node.rt.size

    def rotate(self, node):
        par = node.par
        if par is None:
            return
        ppar = par.par
        if par.lt == node:
            rt = node.rt
            par.lt = rt
            par.par = node
            node.rt = par
            self.update(par)
            self.update(node)
            if rt is not None:
                rt.par = par
            node.par = ppar
            if ppar is None:
                return
            if ppar.lt == par:
                ppar.lt = node
            else:
                ppar.rt = node
        else:
            lt = node.lt
            par.rt = lt
            par.par = node
            node.lt = par
            self.update(par)
            self.update(node)
            if lt is not None:
                lt.par = par
            node.par = ppar
            if ppar is None:
                return
            if ppar.rt == par:
                ppar.rt = node
            else:
                ppar.lt = node

    def splay(self, node):
        while node.par is not None:
            self.rotate(node)
        self.size = node.size
        self.root = node

    def get(self, k):
        node = self.root
        if self.size <= k:
            return False
        while True:
            lsize = 0 if node.lt is None else node.lt.size
            if lsize == k:
                self.splay(node)
                return node
            if lsize > k:
                node = node.lt
            else:
                k -= lsize + 1
                node = node.rt

    def find(self, val):
        node = self.root
        if node is None:
            return False, 0
        count = 0
        while True:
            lsize = 0 if node.lt is None else node.lt.size
            if node.val == val:
                self.splay(node)
                return True, count + lsize
            if node.val > val:
                if node.lt is None:
                    return False, count + lsize
                else:
                    node = node.lt
            else:
                if node.rt is None:
                    return False, count + lsize + 1
                else:
                    count += lsize + 1
                    node = node.rt

    def merge(self, other):
        if self.size == 0:
            self.size = other.size
            self.root = other.root
            return
        if other.size == 0:
            return
        lnode = self.get(self.size - 1)
        rnode = other.get(0)
        rnode.par = lnode
        lnode.rt = rnode
        self.update(lnode)
        self.root = lnode
        self.size = lnode.size

    def split(self, k):
        other = SplayTree()
        if k == 0:
            other.root = self.root
            other.size = self.size
            self.size = 0
            self.root = None
            return other
        if k == self.size:
            return other
        root = self.get(k)
        lroot = root.lt
        rroot = root
        rroot.lt = None
        lroot.par = None
        self.update(lroot)
        self.update(rroot)
        self.size = lroot.size
        self.root = lroot
        other.size = rroot.size
        other.root = rroot
        return other

    def insert(self, val):
        _, k = self.find(val)
        rtree = self.split(k)
        nnode = SplayNode(val)
        ntree = SplayTree()
        ntree.root = nnode
        ntree.size = 1
        self.merge(ntree)
        self.merge(rtree)

    def delete(self, val):
        exist, k = self.find(val)
        if not exist:
            return
        rtree = self.split(k + 1)
        deleted = self.split(k)
        self.merge(rtree)

    def delete_kth(self, k):
        rtree = self.split(k + 1)
        deleted = self.split(k)
        self.merge(rtree)


import sys
input = sys.stdin.readline

Q, K = map(int, input().split())

st = SplayTree()
res = []

for _ in range(Q):
    q = tuple(map(int, input().split()))
    if q[0] == 1:
        st.insert(q[1])
    else:
        v = st.get(K - 1)
        if not v:
            res.append(-1)
        else:
            res.append(v.val)
            st.delete_kth(K - 1)

print('\n'.join(map(str, res)))