description: This problem is an extension of the problem "Wonderful Coloring - 1". It has quite many differences, so you should read this statement completely.
  
  Recently, Paul and Mary have found a new favorite sequence of integers a_1, a_2, ..., a_n. They want to paint it using pieces of chalk of k colors. The coloring of a sequence is called wonderful if the following conditions are met:
  
    1. each element of the sequence is either painted in one of k colors or isn't painted; 
    2. each two elements which are painted in the same color are different (i. e. there's no two equal values painted in the same color); 
    3. let's calculate for each of k colors the number of elements painted in the color — all calculated numbers must be equal; 
    4. the total number of painted elements of the sequence is the maximum among all colorings of the sequence which meet the first three conditions. 
  
  
  
  E. g. consider a sequence a=[3, 1, 1, 1, 1, 10, 3, 10, 10, 2] and k=3. One of the wonderful colorings of the sequence is shown in the figure.
  
  <image> The example of a wonderful coloring of the sequence a=[3, 1, 1, 1, 1, 10, 3, 10, 10, 2] and k=3. Note that one of the elements isn't painted.
  
  Help Paul and Mary to find a wonderful coloring of a given sequence a.
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 10000) — the number of test cases. Then t test cases follow.
  
  Each test case consists of two lines. The first one contains two integers n and k (1 ≤ n ≤ 2⋅10^5, 1 ≤ k ≤ n) — the length of a given sequence and the number of colors, respectively. The second one contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n).
  
  It is guaranteed that the sum of n over all test cases doesn't exceed 2 ⋅ 10^5.
  
  Output
  
  Output t lines, each of them must contain a description of a wonderful coloring for the corresponding test case.
  
  Each wonderful coloring must be printed as a sequence of n integers c_1, c_2, ..., c_n (0 ≤ c_i ≤ k) separated by spaces where
  
    * c_i=0, if i-th element isn't painted; 
    * c_i>0, if i-th element is painted in the c_i-th color. 
  
  
  
  Remember that you need to maximize the total count of painted elements for the wonderful coloring. If there are multiple solutions, print any one.
  
  Example
  
  Input
  
  
  6
  10 3
  3 1 1 1 1 10 3 10 10 2
  4 4
  1 1 1 1
  1 1
  1
  13 1
  3 1 4 1 5 9 2 6 5 3 5 8 9
  13 2
  3 1 4 1 5 9 2 6 5 3 5 8 9
  13 3
  3 1 4 1 5 9 2 6 5 3 5 8 9
  
  
  Output
  
  
  1 1 0 2 3 2 2 1 3 3
  4 2 1 3
  1
  0 0 1 1 0 1 1 1 0 1 1 1 0
  2 1 2 2 1 1 1 1 2 1 0 2 2
  1 1 3 2 1 3 3 1 2 2 3 2 0
  
  Note
  
  In the first test case, the answer is shown in the figure in the statement. The red color has number 1, the blue color — 2, the green — 3.
solution: import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  // Created by @thesupremeone on 23/07/21
  public class B2 {
      static class Pair implements Comparable<Pair>{
          int element;
          TreeSet<Integer> set;
          public Pair(int element, TreeSet<Integer> set) {
              this.element = element;
              this.set = set;
          }
          @Override
          public int compareTo(Pair pair) {
              return Integer.compare(pair.set.size(), set.size());
          }
      }
      void solve() throws IOException {
          int ts = getInt();
          for (int t = 1; t <= ts; t++){
              int n = getInt();
              int k = getInt();
              HashMap<Integer, Integer> freq = new HashMap<>();
              TreeMap<Integer, TreeSet<Integer>> indexes = new TreeMap<>();
              int[] a = new int[n];
              for (int i = 0; i < n; i++){
                  int ai = getInt();
                  a[i] = ai;
                  freq.put(ai, 1+freq.getOrDefault(ai, 0));
                  TreeSet<Integer> set;
                  if(indexes.containsKey(ai)){
                      set = indexes.get(ai);
                  }else {
                      set = new TreeSet<>();
                      indexes.put(ai, set);
                  }
                  set.add(i);
              }
              long sum = 0;
              for (int e : freq.keySet()){
                  sum += Math.min(k, freq.get(e));
              }
              int count = (int)(sum/k);
              int[] coloring = new int[n];
              int[] colorUsed = new int[k+1];
              Pair[] pairs = new Pair[indexes.size()];
              int i = 0;
              for(int element: indexes.keySet()) {
                  pairs[i++] = new Pair(element, indexes.get(element));
              }
              Arrays.sort(pairs);
              int color = 1;
              for(Pair pair : pairs){
                  TreeSet<Integer> locations = pair.set;
                  if(colorUsed[color]==count) break;
                  int start = color;
                  for(int index : locations){
                      coloring[index] = color;
                      colorUsed[color]++;
                      color++;
                      if(color>k) color=1;
                      if(color==start) break;
                      if (colorUsed[color]==count) break;
                  }
              }
              for (int c : coloring){
                  print(c+" ");
              }
              println("");
          }
      }
  
      public static void main(String[] args) throws Exception {
          if (isOnlineJudge()) {
              in = new BufferedReader(new InputStreamReader(System.in));
              out = new BufferedWriter(new OutputStreamWriter(System.out));
              new B2().solve();
              out.flush();
          } else {
              localJudge = new Thread();
              in = new BufferedReader(new FileReader("input.txt"));
              out = new BufferedWriter(new FileWriter("output.txt"));
              localJudge.start();
              new B2().solve();
              out.flush();
              localJudge.suspend();
          }
      }
      static boolean isOnlineJudge(){
          try {
              return System.getProperty("ONLINE_JUDGE")!=null
                      || System.getProperty("LOCAL")==null;
          }catch (Exception e){
              return true;
          }
      }
      // Fast Input & Output
      static Thread localJudge = null;
      static BufferedReader in;
      static StringTokenizer st;
      static BufferedWriter out;
      static String getLine() throws IOException{
          return in.readLine();
      }
      static String getToken() throws IOException{
          if(st==null || !st.hasMoreTokens())
              st = new StringTokenizer(getLine());
          return st.nextToken();
      }
      static int getInt() throws IOException {
          return Integer.parseInt(getToken());
      }
      static long getLong() throws IOException {
          return Long.parseLong(getToken());
      }
      static void print(Object s) throws IOException{
          out.write(String.valueOf(s));
      }
      static void println(Object s) throws IOException{
          out.write(String.valueOf(s));
          out.newLine();
      }
  }