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.io.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.PrintWriter;
  import java.util.Iterator;
  import java.util.Set;
  import java.util.Scanner;
  import java.util.HashMap;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.StringTokenizer;
  import java.util.Map.Entry;
  import java.io.BufferedReader;
  import java.io.InputStream;
  
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   *
   * @author valeesi
   */
  public class Main {
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
          B2WonderfulColoring2 solver = new B2WonderfulColoring2();
          int testCount = Integer.parseInt(in.next());
          for (int i = 1; i <= testCount; i++)
              solver.solve(i, in, out);
          out.close();
      }
  
      static class B2WonderfulColoring2 {
          public void solve(int testNumber, InputReader in, PrintWriter out) {
              int n = in.nextInt(), k = in.nextInt();
              int[] arr = in.nextIntArray(n);
  
              var map = new HashMap<Integer, ArrayList<Integer>>();
              int[] paint = new int[n];
              for (int i = 0; i < arr.length; i++) {
                  map.put(arr[i], new ArrayList<>());
              }
  
              for (int i = 0; i < arr.length; i++) {
                  map.get(arr[i]).add(i);
              }
  
              var iter = map.entrySet().iterator();
  
              while (iter.hasNext()) {
                  var entry = iter.next();
                  if (entry.getValue().size() >= k) {
                      for (int i = 0; i < entry.getValue().size(); i++) {
                          if (i < k) {
                              paint[entry.getValue().get(i)] = i + 1;
                          } else {
                              paint[entry.getValue().get(i)] = 0;
                          }
                      }
                      iter.remove();
                  }
              }
              int rest = 0;
              for (var entry : map.entrySet()) {
                  rest += entry.getValue().size();
              }
  
              rest = (rest / k) * k;
  
              for (var entry : map.entrySet()) {
                  for (int i = 0; i < entry.getValue().size(); i++) {
                      if (rest > 0) {
                          paint[entry.getValue().get(i)] = rest % k + 1;
                          rest--;
                      } else {
                          paint[entry.getValue().get(i)] = 0;
                      }
                  }
              }
              out.println(Printer.print(paint) + " ");
          }
  
      }
  
      static class InputReader {
          public BufferedReader reader;
          public StringTokenizer tokenizer;
          public Scanner scanner;
  
          public InputReader(InputStream stream) {
              reader = new BufferedReader(new InputStreamReader(stream), 32768);
              scanner = new Scanner(reader);
              tokenizer = null;
          }
  
          public String next() {
              while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public int[] nextIntArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++)
                  a[i] = nextInt();
              return a;
          }
  
      }
  
      static class Printer {
          public static String print(int[] arr) {
              return print(arr, " ");
          }
  
          public static String print(int[] arr, String separator) {
              if (arr == null || arr.length == 0) {
                  return "";
              }
  
              StringBuilder sb = new StringBuilder();
              for (int i = 0; i < arr.length; i++) {
                  if (i < arr.length - 1) {
                      sb.append(arr[i]).append(separator);
                  } else {
                      sb.append(arr[i]);
                  }
              }
              return sb.toString();
          }
  
      }
  }
  
  