#define _GLIBCXX_DEBUG
#define ll long long
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;

int main(){
  int N, K; cin >> N >> K;
  vector<int> A(N);
  for(int i = 0; i < N; i++) cin >> A[i];
  sort(A.begin(), A.end());
  int ans = 0;
  for(int i = 400; i >= 0; i--){
    int sum = 0;
    for(int j = 0; j < N; j++){
      if(i <= A[j]) sum++;
    }
    if(K < sum){
      cout << ans << endl;
      return 0;
    }
    ans = max(ans, sum);
  }
  cout << ans << endl;
}