#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int main(){
  int n,k;
  cin>>n>>k;
  
  vector<int> P(n);
  rep(i,n) cin>>P[i];
  
  int ng=0,ok=500;
  while(ok-ng>1){
    int mid=(ng+ok)/2;
    int cnt=0;
    rep(i,n){
      if(P[i]>=mid) cnt++;
    }
    if(cnt<=k) ok=mid;
    else ng=mid;
  }
  int ans=0;
  rep(i,n){
    if(P[i]>=ok) ans++;
  }
  cout<<ans<<endl;
  
  return 0;
}