#include <bits/stdc++.h>

using namespace std;

int n, k;
vector<int> nums;

int main() {
    scanf("%d %d", &n, &k);
    nums.resize(n);
    
    for (int i = 0; i < n; i++) scanf("%d", &nums[i]);
    
    sort(nums.begin(), nums.end());
    
    int las = nums[n - k];
    int p = n - k - 1;
    
    while (p >= 0 && nums[p] == las) {
        k++;
        p--;
    }
    
    printf("%d\n", k);
    
    return 0;
}