#include <iostream>

void sort(int* a, int n)
{
int i, j, min, temp;
for (i = 0; i < n - 1; i++) {
min = i;
for (j = i + 1; j < n; j++)
if (a[j] > a[min])
min = j;
temp = a[i];
a[i] = a[min];
a[min] = temp;
}
}

int main()
{
int n, k;
std::cin >> n >> k;
if (n == k || n < k)
{
std::cout << k;
return 0;
}
int* scores = new int[n];
for (int i=0; i<n; i++)
std::cin >> scores[i];
sort(scores, n);
while (k+1 < n)
{
if (scores[k-1] != scores[k])
break;
k++;
}
std::cout << k;
delete scores;
return 0;
}