// Patryk Jędrzejczak

#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define MP make_pair
#define ST first
#define ND second
#define S size
#define RS resize
#define endl '\n'
#define L long long

template<class T> using V = vector<T>;

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

  int n, k;
  cin >> n >> k;

  V<int> a(n);
  REP(i, n) {
    cin >> a[i];
  }

  V<int> count(121);
  REP(i, n) {
    count[a[i]]++;
  }

  int points = 120;
  int winners = 0;
  while (winners < k) {
    winners += count[points];
    points--;
  }

  cout << winners;
}