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.*;
  
  //           THIS TEMPLATE MADE BY AKSH BANSAL.
  
  public class Solution {
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      private static boolean[] isPrime;
      private static void primes(){
          int num = (int)1e6; // PRIMES FROM 1 TO NUM
          isPrime = new boolean[num];
       
          for (int i = 2; i< isPrime.length; i++) {
             isPrime[i] = true;
          }
          for (int i = 2; i< Math.sqrt(num); i++) {
             if(isPrime[i] == true) {
                for(int j = (i*i); j<num; j = j+i) {
                   isPrime[j] = false;
                }
             }
          }
      }
      static void sort(int a[]){ // int -> long
          ArrayList<Integer> arr=new ArrayList<>(); // Integer -> Long
          for(int i=0;i<a.length;i++)
          arr.add(a[i]);
          Collections.sort(arr);
          for(int i=0;i<a.length;i++)
          a[i]=arr.get(i);
          
      }
      private static long gcd(long a, long b){
          if(b==0)return a;
          return gcd(b,a%b);
      }
      private static long pow(long x,long y){
          if(y==0)return 1;
          long temp = pow(x, y/2);
          if(y%2==1){
              return x*temp*temp;
          }
          else{
              return temp*temp;
          }
      }
      // static ArrayList<Integer>[] adj;
      // static void getAdj(int n,int q, FastReader sc){
      //     adj = new ArrayList[n+1];
      //     for(int i=1;i<=n;i++){
      //         adj[i] = new ArrayList<>();
      //     }
      //     for(int i=0;i<q;i++){
      //         int a = sc.nextInt();
      //         int b = sc.nextInt();
  
      //         adj[a].add(b);
      //         adj[b].add(a);
      //     }
      // }
      static PrintWriter out;
      static FastReader sc ;
      public static void main(String[] args) throws IOException {
          sc = new FastReader();
          out = new PrintWriter(System.out);
          // primes();
          // ________________________________
  
          int t = sc.nextInt();
          StringBuilder output = new StringBuilder();
  
          while (t-- > 0) {
              int n = sc.nextInt();
              int k = sc.nextInt();
              int[] arr = new int[n];
              for(int i=0;i<n;i++){
                  arr[i] = sc.nextInt();
              }
              // output.append().append("\n");
              solver(n, arr, k);
          }
  
          out.println(output);
          // _______________________________
  
          // int n = sc.nextInt();
          // out.println(solver());
          // ________________________________
          out.flush();
      }
  
      public static void solver(int n, int[] arr,  int k) {
          HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();
          for(int i=0;i<n;i++){
              if(!map.containsKey(arr[i])){
                  map.put(arr[i] , new ArrayList<>());
              }
              map.get(arr[i]).add(i);
          }
          int[] res=  new int[n];
          Stack<Integer> extra = new Stack<>();
          int cunt =0;
          for(Integer key: map.keySet()){
              int len = map.get(key).size();
              for(int i=0;i<Math.min(k, len); i++){
                  int pos =map.get(key).get(i); 
                  res[pos] = cunt+1;
                  cunt = (cunt+1)%k;
                  extra.push(pos);
              }
              // System.out.println("__"+ cunt);
          }
          while(cunt-->0){
              res[extra.pop()] = 0;
          }
          for(int i=0;i<n;i++){
              out.print(res[i]+" ");
          }
          out.println();
      }
  }