#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n, k;
    cin >> n >> k;
    vector<int32_t> ps(n);
    for (auto &&p : ps) {
        cin >> p;
    }
    if (k == n) {
        cout << n << endl;
        return 0;
    }
    ps.push_back(numeric_limits<int32_t>::max());
    sort(ps.rbegin(), ps.rend());
    while (ps[k] == ps[k + 1]) {
        --k;
    }
    cout << k << endl;
    return 0;
}