#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
using namespace std;

int main() {
  int n, k;
  cin >> n >> k;

  map<int, int> table;
  for (int i = 0; i < n; ++i) {
    int v;
    cin >> v;
    table[v]++;
  }

  vector<int> v;
  for(auto p: table)
      v.push_back(p.second);

  sort(v.begin(), v.end());

  int ans = 0;
  int total = 0;
  while (total < k) {
    total += v[v.size()  - ++ans];
  }
  cout << ans << '\n';

}