#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int p[200];
int main() {
	int n, k;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		cin >> p[i];
	}
	sort(p, p + n);
	int ans = 0;
	for (int i = 0; i <= 400; i++) {
		auto itr = lower_bound(p, p + n, i);
		int co = int(n - (itr - p));
		if (ans < co && co <= k) {
			ans = co;
		}
	}
	cout << ans << endl;
}