#include <bits/stdc++.h>

using namespace std;
const int N = 2000 + 7;
int tab[N];

void Solve()
{
    int n, k, w;
    cin >> n >> k;
    for(int i = 1; i <= n; ++i)
    {
        cin >> tab[i];
        tab[i] *= -1;
    }
    sort(tab + 1, tab + 1 + n);
    w = k;
    while(tab[w + 1] == tab[w])
        ++w;
    cout << w << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    Solve();

    return 0;
}