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: // package com.company;
  import java.util.*;
  import java.io.*;
  import java.lang.*;
  import java.util.jar.JarEntry;
  
  public class Main{
      /* || श्री गणेशाय नमः ||
         @𝐚𝐮𝐭𝐡𝐨𝐫 𝐉𝐢𝐠𝐚𝐫 𝐍𝐚𝐢𝐧𝐮𝐣𝐢
         𝐒𝐕𝐍𝐈𝐓- 𝐒𝐮𝐫𝐚𝐭
      */
      public static void main(String args[]){
          InputReader in=new InputReader(System.in);
          TASK solver = new TASK();
          int t=1;
          t = in.nextInt();
          for(int i=1;i<=t;i++)
          {
              solver.solve(in,i);
          }
      }
      static class TASK {
  
  
          void solve(InputReader in, int testNumber) {
             int n = in.nextInt();
             int k = in.nextInt();
             ArrayList<Integer>[] al = new ArrayList[n+1];
             for(int i=0;i<=n;i++)
                 al[i]=new ArrayList<>();
             for(int i=0;i<n;i++)
             {
                 int x = in.nextInt();
                 al[x].add(i);
             }
             PriorityQueue<pair> pq = new PriorityQueue<>(new Comparator<pair>() {
                 @Override
                 public int compare(pair o1, pair o2) {
                     if(o1.x==o2.x)
                        return o1.y-o2.y;
                     return o1.x-o2.x;
                 }
             });
             for(int i=1;i<=k;i++)
             {
                 pq.add(new pair(0,i));
             }
             int ans[] = new int[n];
             for(int i=1;i<=n;i++)
             {
                 for(int j=0;j<al[i].size() && j<k;j++)
                 {
                     pair p = pq.poll();
                     ans[al[i].get(j)]=p.y;
                     pq.add(new pair(p.x+1,p.y));
                 }
             }
             int x[] = new int[n+1];
             int min = Integer.MAX_VALUE;
             while (pq.size()!=0)
             {
                 pair p = pq.poll();
                 x[p.y]=p.x;
                 min=Math.min(x[p.y],min);
             }
             for(int i=0;i<n;i++) {
                 if(x[ans[i]]==min)
                 {
                     System.out.print(ans[i]+" ");
                 }
                 else
                 {
                     x[ans[i]]--;
                     System.out.print(0+" ");
                 }
             }
              System.out.println();
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
          }
      }
  
  
      static class pair{
          int x ;
          int y;
          pair(int x,int y)
          {
              this.x=x;
              this.y=y;
          }
      }
  
      static class Maths {
          static long gcd(long a, long b) {
              if (a < b)
                  return gcd(b,a);
              if (b == 0)
                  return a;
              else
                  return gcd(b,a%b);
          }
          public static long lcm(long a, long b) {
              return (a * b) / gcd(a, b);
          }
  
      }
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
          public InputReader(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 String nextLine() {
              BufferedReader br = new BufferedReader(new
                      InputStreamReader(System.in));
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
          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 *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
              return res * sgn;
          }
          public double nextDouble() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E')
                      return res * Math.pow(10, nextInt());
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E')
                          return res * Math.pow(10, nextInt());
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
          public String readString() {
              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 String next() {
              return readString();
          }
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  }
  
  