#include<iostream>
#include<fstream>
using namespace std;
void quicksort(int v[],int left,int right){
    int i=left,j=right;
    int pivot=v[(left+right)/2];
    int aux;
    while(i<=j){
            while(v[i]<pivot)
            i++;
    while(v[j]>pivot)
        j--;
    if(i<=j){
            aux=v[i];
    v[i]=v[j];
    v[j]=aux;
    i++;
    j--;}
    }
        if(left<j)
            quicksort(v,left,j);
        if(i<right)
            quicksort(v,i,right);}
        int main(){
            ifstream f("sdo.in");
            ofstream g("sdo.out");
            int n,k,arr[100],i;
            f>>n>>k;
            for(i=1;i<=n;i++)
                f>>arr[i];
            quicksort(arr,1,n);
          g<<arr[k];
            return 0;}