import java.util.*;

public class Array {
  public static int findMinK(int a[], int k) {
    int n = a.length;
    int[] temp = new int[n];

    for (int i = 0; i < n; i++) temp[i] = a[i];

    Arrays.sort(temp);

    int count = 1, previousNumber = temp[0];

    for (int i = 1; i < n; i++) {
      if (temp[i] != previousNumber) {
        count++;
        previousNumber = temp[i];
      }

      if (count == k) return temp[i];
    }

    return Integer.MAX_VALUE;
  }

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int k = sc.nextInt();
    int[] array = new int[n];

    for (int i = 0; i < n; i++) array[i] = sc.nextInt();

    System.out.println(findMinK(array, k));
  }
}