#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=998244353;


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

    map<int,int> mp;
    for(int i=0;i<N;i++){
        mp[A[i]]++;
    }

    priority_queue<P> pq;
    for(auto [v,num]:mp){
        pq.emplace(num,v);
    }
    set<int> ans;
    int cnt=0;
    while(cnt<K && !pq.empty()){
        auto [num,v]=pq.top();
        cnt+=num;
        pq.pop();
        ans.insert(v);
    }

    cout<<ans.size()<<endl;

}