import sys
from collections import deque

# Define a class for tree nodes
class TreeNode:
    def __init__(self, value):
        self.val = value
        self.left = None
        self.right = None

# Insert a value into the Binary Search Tree (BST)
def insert_bst(root, value):
    if root is None:
        return TreeNode(value)  # Create a new node if the current node is None
    if value < root.val:
        root.left = insert_bst(root.left, value)  # Insert into the left subtree if the value is smaller
    else:
        root.right = insert_bst(root.right, value)  # Insert into the right subtree if the value is larger
    return root

# Find the k-th smallest element in the BST using in-order traversal
def kth_smallest(root, k):
    stack = []
    current = root
    count = 0

    while True:
        # Traverse the left subtree
        while current is not None:
            stack.append(current)
            current = current.left
        
        if not stack:
            return None  # If the stack is empty, there are fewer than k elements
        
        # Pop the node from the stack
        current = stack.pop()
        count += 1

        # If the count matches k, return the current node's value
        if count == k:
            return current.val
        
        # Traverse the right subtree
        current = current.right

# Main function to read input and output the k-th smallest element
def main():
    # Read the number of nodes and the value of k
    n, k = map(int, sys.stdin.readline().strip().split())
    # Read the values to insert into the BST
    values = list(map(int, sys.stdin.readline().strip().split()))
    
    root = None
    # Insert all values into the BST
    for value in values:
        root = insert_bst(root, value)
    
    # Find and print the k-th smallest element
    result = kth_smallest(root, k)
    print(result)

# Entry point of the script
if __name__ == "__main__":
    main()