#include <bits/stdc++.h>


using namespace std;


int solve(int n, int k, vector <int> &val) {
    sort(val.begin(), val.end(), greater <int> ());

    int idx = k - 1;
    while (idx < n - 1 && val[idx] == val[idx + 1]) {
        idx++;
    }

    return idx + 1;
}

int main() {
    ios_base::sync_with_stdio(false);

    int n, k;
    cin >> n >> k;

    vector <int> val(n);
    for (int &vi : val) {
        cin >> vi;
    }

    cout << solve(n, k, val);

    return 0;
}