#include <iostream>
#include <algorithm>
using namespace std;

int tab[2009];

void task(int n, int k) {
    int ans = k;
    int i = k;
    while (tab[i] == tab[k - 1]) {
        ans++;
        i++;
    }
    cout << ans;
}

int main()
{
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> tab[i];
        tab[i] *= -1;
    }
    tab[n] = 200;
    sort(tab, tab + n);
    task(n, k);
}