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.*;
  
   // Author : Yash Shah
  
  public class B implements Runnable {
  
      public void run() {
         	
          InputReader sc = new InputReader(System.in);
          PrintWriter out = new PrintWriter(System.out);
          
          int t = sc.nextInt();
  
          while(t--!=0)
          {
              int n = sc.nextInt();
              int k = sc.nextInt();
              int a[] = new int[n];
              sa(a,sc);
              HashMap<Integer,ArrayList<Integer>> map = new HashMap<>();
              int cnt = 0;
              for(int i:a) 
              {
                  if(!map.containsKey(i)) map.put(i,new ArrayList<>());
                  map.get(i).add(cnt++);
              }
              int sum = 0;
              int ans[] = new int[n];
              
              for(Map.Entry<Integer,ArrayList<Integer>> i:map.entrySet()) 
              {
                  sum += Math.min(k,i.getValue().size());
              }
  
              sum -= sum%k;
              int color = 1;
              for(Map.Entry<Integer,ArrayList<Integer>> i:map.entrySet()) 
              {
                
                  int m = Math.min(k,i.getValue().size());
                  for(int j=0;j<m&&sum>0;j++)
                  {
                      ans[i.getValue().get(j)] = color;
                      sum--;
                      color++;
                      if(color==k+1)
                      {
                          color = 1;
                      } 
                  } 
              }
  
              for(int i:ans) out.print(i+" ");
              out.println();
          }
          
          out.close();
      }
   
  //========================================================================
  
  	
  	static void sa(int a[],InputReader sc)
  	{
  		for(int i=0;i<a.length;i++)
  		{
  			a[i]=sc.nextInt();
  		}
          // Arrays.sort(a);
  	}
  
  	static class pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<pair<U, V>> {
          public U x;
          public V y;
  
          public pair(U x, V y) {
              this.x = x;
              this.y = y;
          }
  
          public int compareTo(pair<U, V> other) {
              int i = x.compareTo(other.x);
              if (i != 0) return i;
              return y.compareTo(other.y);
          }
  
          public String toString() {
              return x.toString() + " " + y.toString();
          }
  
          public boolean equals(Object obj) {
              if (this.getClass() != obj.getClass()) return false;
              pair<U, V> other = (pair<U, V>) obj;
              return x.equals(other.x) && y.equals(other.y);
          }
  
          public int hashCode() {
              return 31 * x.hashCode() + y.hashCode();
          }
  
      }
  
  
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
          private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
   
          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() {
              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);
          }
      }
  
      public static void main(String args[]) throws Exception {
          new Thread(null, new B(),"Main",1<<27).start();
      }
  }
  