#include <bits/stdc++.h>

using namespace std;

int wor[2000];

int main() {
   int n,k,ans=0;
   cin >> n >> k;
   for(int i=0;i<n;i++)
   {
       int el;
       cin >> el;
       wor[i]=-el;
   }
   sort(wor,wor+n);
   for(int i=k;i<n;i++)
   {
        int curr=-wor[i];
        //acout << curr << '\n';
        int prev=-wor[i-1];
        if(prev==curr)
        {
            ans++;
        }
        else break;
   }
   cout << ans+k;
    return 0;
}