#include <bits/stdc++.h>
#define NIL (-1)
#define ll long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int main() {
	int N, K;
	cin >> N >> K;

	vector<int> p(401);
	for (int i = 0; i < N; i++) {
		int n;
		cin >> n;
		p[n]++;
	}

	int ans = 0;
	for (int i = 0; i < p.size(); i++) {
		int n = p[p.size() -1- i];
		if (ans + n > K) break;
		ans += n;
	}
	cout << ans << endl;

	return 0;
}