//by KR koszulki [kos] c
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
	int n, k;
	vector <int> a;
	cin >> n >> k;
	int wynik = k;
	for (int i = 0; i < n; i++)
	{
		int p;
		cin >> p;
		a.push_back(p);
	}
	sort(a.begin(), a.end());
	if (n != k) 
	{
		for (int i = n - k; a[i] == a[i - 1]; i--)
		{
			wynik++;
		}
	}

	cout << wynik;
	return 0;
}