#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

int main(){
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    rep(i, 0, N) cin >> A[i];

    map<int, int> mp;
    rep(i, 0, N) mp[A[i]]++;

    vector<int> vec;
    for(auto m : mp) vec.push_back(m.second);
    sort(vec.begin(), vec.end(), greater<int>());

    int cnt = 0, ans = 0;
    rep(i, 0, N){
        cnt += vec[i];
        if(cnt >= K){
            cout << i+1 << endl;
            return 0;
        }
    }
}