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

int main(){
  int t;
  cin >> t;
  while (t--){
    int n, k, ans = 0;
    cin >> n >> k;
    map<int, int> mp;
    vector<int> a(n), b;
    for (int i = 0; i < n; i++){
      cin >> a[i];
      mp[a[i]]++;
    }
    int x = (n + (k - 1)) / k;
    for (auto [f, s] : mp){
      b.push_back(s);
    }
    sort(b.rbegin(), b.rend());
    for (int i = 1; i < b.size() && i < k; i++){
      ans += b[i];
    }
    if (ans >= b[0]) ans += b[0];
    else ans = b[0];
    cout << n - ans << endl; //mx<<" "<<j<<endl;
  }
}