#include <iostream>
using namespace std;

int tabLen, k ;

void swap(int* a, int* b){
    int t = *a;
    *a = *b;
    *b = t;
}
int partition (int arr[], int low, int high){
    int pivot = arr[high];
    int i = (low - 1);
    for (int j = low; j <= high- 1; j++){
        if (arr[j] >= pivot){
            i++;
            swap(&arr[i], &arr[j]);
        }
    }
    swap(&arr[i + 1], &arr[high]);
    return (i + 1);
}
void quickSort(int arr[], int low, int high){
    if (low < high) {
        int pivot = partition(arr, low, high);
        quickSort(arr, low, pivot - 1);
        quickSort(arr, pivot + 1, high);
    }
}


int main(){
    cin >> tabLen >> k ;
    int tab[tabLen];
    for(int i = 0 ;i != tabLen ; i++) {
        cin >> tab[i];
    }
    quickSort(tab,0,tabLen-1);
    int lastT = tab[k-1];
    int i = k ;
    while (lastT == tab[i]){
        k++ ; i++ ;
    }
    cout << k << endl;
}