#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
int n, k;
map<int, int> cnt;

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    cin >> n >> k;
    set<int> cur;
    rep(i, n) {
        int a;
        cin >> a;
        cur.insert(a);
        cnt[a]++;
    }
    vc<int> tmp(cur.begin(), cur.end());
    int res = 0;
    sort(tmp.begin(), tmp.end(), greater<int>());
    for (auto num : tmp) {
        if (k - cnt[num] >= 0) {
            k -= cnt[num];
            res += cnt[num];
        } else {
            break;
        }
        if (k == 0) break;
    }
    cout << res << endl;
}