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.*;
  import java.util.*;
  import static java.lang.System.*;
  import static java.lang.Math.*;
  public class CodechefCook
  {
      void run() {
          int tc=ni();
          StringBuilder sb = new StringBuilder();
          while(tc-->0) {
              int n=ni(),k=ni(),a[]=ni(n);
              Map<Integer,Integer> map = new HashMap<>();
              Map<Integer,Stack<Integer>> mstk= new HashMap<>();
              for(int i=0;i<n;i++) {
                  map.put(a[i],map.getOrDefault(a[i],0)+1);
              }
              List<Integer>[] set = new ArrayList[k];
              for(int i=0;i<k;i++) {
                  set[i] = new ArrayList<>();
              }
              int indx=0,ct=0;
              for(Map.Entry<Integer,Integer> m:map.entrySet()) {
                  int key=m.getKey(),v=m.getValue();
                  int en=indx;
                  while(indx<k && v>0) {
                      set[indx++].add(key);
                      v--;
                  }
                  if(indx==k) { indx=0; ct++; }
                  while(indx<en && v>0) {
                      set[indx++].add(key);
                      v--;
                  }
                  if(indx==k) { indx=0; ct++; }
              }
  
              // out.println("# "+ct);
              // for(int i=0;i<k;i++) out.println("# "+set[i]);
  
              for(int i=0;i<k;i++) {
                  int x=ct;
                  for(int e:set[i]) {
                      mstk.put(e,mstk.getOrDefault(e,new Stack<>()));
                      mstk.get(e).add(i+1);
                      if(--x==0) break;
                  }
              }
              for(int i=0;i<n;i++) {
                  if(!mstk.containsKey(a[i]) || mstk.get(a[i]).isEmpty()) sb.append("0 ");
                  else sb.append(mstk.get(a[i]).pop()).append(" ");
              }
              sb.append("\n");
          }
          out.println(sb);
          out.flush(); 
          out.close();
      }
  
      public static void main(String[] args)throws Exception {
          try { 
              // new Thread(null, new CodechefCook()::run, "1", 1 << 26).start();
              new Thread(null, new CodechefCook("ONLINE_JUDGE")::run, "1", 1 << 26).start();
          } catch(Exception e) {}
      }
  
      FastReader sc=null;PrintWriter out = null;
      public CodechefCook()throws Exception {
          sc = new FastReader(new FileInputStream("D:\\CP\\input.txt"));
          out = new PrintWriter(new BufferedWriter(new FileWriter("D:\\CP\\output.txt")));
      }
      public CodechefCook(String JUDGE) {
          sc = new FastReader(System.in);
          out = new PrintWriter(System.out);      
      }
      
      String ns() { return sc.next(); }
      int ni() { return sc.nextInt(); }
      long nl() { return sc.nextLong(); }
      int[] ni(int n) {
          int a[]=new int[n];
          for(int i=0;i<n;a[i++]=ni());
          return a;
      }
      long[] nl(int n) {
          long a[]=new long[n];
          for(int i=0;i<n;a[i++]=nl());
          return a;
      }
      
      int[][] ni(int n,int m) {
          int a[][]=new int[n][m];
          for(int i=0;i<n;i++) 
              for(int j=0;j<m;j++)
                  a[i][j]=ni();
          return a;
      }
      long[][] nl(int n,int m) {
          long a[][]=new long[n][m];
          for(int i=0;i<n;i++) 
              for(int j=0;j<m;j++)
                  a[i][j]=nl();
          return a;
      }
      int gcd(int a, int b) {
          return b==0?a:gcd(b,a%b);
      }
      static class FastReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private FastReader.SpaceCharFilter filter;
          public FastReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1) throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0) return -1;
              }
              return buf[curChar++];
          }
  
          public int nextInt() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9') throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
              return res * sgn;
          }
          
          public long nextLong() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
              do {
                  if (c < '0' || c > '9') throw new InputMismatchException();
                  res = res*1L*10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
              return res *1L* sgn;
          }
          
          public String next() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null) return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
  
          }
      }
  }