#include <bits/stdc++.h>
using namespace std;

int main()
{
    int N, K;
    cin >> N >> K;
    vector<int> A(N + 1);
    for (int i = 0; i < N; i++)
    {
        int a;
        cin >> a;
        A[a]++;
    }
    sort(A.rbegin(), A.rend());
    int now = 0;
    int ans = 0;
    while (now < K)
    {
        now += A[now];
        ans++;
    }
    cout << ans;
}