#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef vector<int> vint;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vint a;
    int ai;
    for (int i = 0; i < n; i++) {
        cin >> ai;
        a.push_back(ai);
    }
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    int last = a[k - 1], counter = 0;
    for (int i = k; i < n; i++) {
        if (a[i] != last) 
            break;
        else
            counter++;
    }
    cout << k + counter;
    return 0;
}