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.nio.*;
  import java.io.*;
  import java.lang.*;
  public class a {
  	 static class InputReader {
  	        public BufferedReader reader;
  	        public StringTokenizer tokenizer;
  	 
  	        public InputReader(InputStream stream) {
  	            reader = new BufferedReader(new InputStreamReader(stream), 32768);
  	            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();
  	        }
  	 
  	    }
  	static class Reader 
      { 
          final private int BUFFER_SIZE = 1 << 16; 
          private DataInputStream din; 
          private byte[] buffer; 
          private int bufferPointer, bytesRead;
          
          public Reader() 
          { 
              din = new DataInputStream(System.in); 
              buffer = new byte[BUFFER_SIZE]; 
              bufferPointer = bytesRead = 0; 
              //br = new BufferedReader(
                      //new InputStreamReader(System.in));
          } 
    
          public Reader(String file_name) throws IOException 
          { 
              din = new DataInputStream(new FileInputStream(file_name)); 
              buffer = new byte[BUFFER_SIZE]; 
              bufferPointer = bytesRead = 0; 
          } 
    
    
          public int nextInt() throws IOException 
          { 
              int ret = 0; 
              byte c = read(); 
              while (c <= ' ') 
                  c = read(); 
              boolean neg = (c == '-'); 
              if (neg) 
                  c = read(); 
              do
              { 
                  ret = ret * 10 + c - '0'; 
              }  while ((c = read()) >= '0' && c <= '9'); 
    
              if (neg) 
                  return -ret; 
              return ret; 
          } 
    
          public long nextLong() throws IOException 
          { 
              long ret = 0; 
              byte c = read(); 
              while (c <= ' ') 
                  c = read(); 
              boolean neg = (c == '-'); 
              if (neg) 
                  c = read(); 
              do { 
                  ret = ret * 10 + c - '0'; 
              } 
              while ((c = read()) >= '0' && c <= '9'); 
              if (neg) 
                  return -ret; 
              return ret; 
          } 
    
          public double nextDouble() throws IOException 
          { 
              double ret = 0, div = 1; 
              byte c = read(); 
              while (c <= ' ') 
                  c = read(); 
              boolean neg = (c == '-'); 
              if (neg) 
                  c = read(); 
    
              do { 
                  ret = ret * 10 + c - '0'; 
              } 
              while ((c = read()) >= '0' && c <= '9'); 
    
              if (c == '.') 
              { 
                  while ((c = read()) >= '0' && c <= '9') 
                  { 
                      ret += (c - '0') / (div *= 10); 
                  } 
              } 
    
              if (neg) 
                  return -ret; 
              return ret; 
          } 
    
          private void fillBuffer() throws IOException 
          { 
              bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
              if (bytesRead == -1) 
                  buffer[0] = -1; 
          } 
    
          private byte read() throws IOException 
          { 
              if (bufferPointer == bytesRead) 
                  fillBuffer(); 
              return buffer[bufferPointer++]; 
          } 
    
          public void close() throws IOException 
          { 
              if (din == null) 
                  return; 
              din.close(); 
          } 
      } 
  	//////////////////////////////////////////////////////////////////////
  	public static void main(String[] args) throws IOException{
  		//Scanner sc=new Scanner(System.in);
  		Reader sc=new Reader();
  		InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
  		StringBuilder finalAnswer=new StringBuilder();
  		//finalAnswer.append(1).append('\n');
  		int t=sc.nextInt();
  		while(t-->0) {
  			int n=sc.nextInt();
  			int k=sc.nextInt();
  			int arr[]=new int[n];
  			Set<Integer> foo=new HashSet<>();
  			for(int i=0;i<n;i++) {
  				arr[i]=sc.nextInt();
  				foo.add(arr[i]);
  			}
  			//System.out.println(Arrays.toString(arr));
  			//System.out.println(foo.size());
  			int brr[]=new int[n];
  			int[] uniqueValue = foo.stream().mapToInt(Integer::intValue).toArray();
  			List<Integer> adj[]=new ArrayList[(int)((2*Math.pow(10, 5))+1)];
  			for(int i=0;i<foo.size();i++) {
  				adj[uniqueValue[i]]=new ArrayList<>();
  			}
  			//System.out.println();
  			for(int i=0;i<n;i++) {
  				//System.out.println(arr[i]+" "+i);
  				adj[arr[i]].add(i);
  			}
  			int howhow=1;
  			List<Integer> list= new ArrayList<>();
  			for(int i=0;i<foo.size();i++) {
  				howhow=1;
  				if(adj[uniqueValue[i]].size()>=k) {
  					for(int j=0;j<adj[uniqueValue[i]].size();j++) {
  						brr[adj[uniqueValue[i]].get(j)]=howhow;
  						howhow++;
  						if(howhow>k) {
  							break;
  						}
  					}
  				}
  				else {
  					for(int j=0;j<adj[uniqueValue[i]].size();j++) {
  						list.add(adj[uniqueValue[i]].get(j));
  					}
  				}
  			}
  			int len=(list.size()/k)*k;;
  //			int time=0;
  //			if(len%k==0) {
  //				time=1;
  //			}
  //			else {
  //				time=(len/k);
  //			}
  //			len=len/3;
  //			for(int i=0;i<n;i++) {
  //				System.out.print(brr[i]+" ");
  //			}
  			//System.out.println(len+" "+"len");
  			//System.out.println(list);
  			howhow=1;
  			for(int i=0;i<len;i++) {
  				brr[list.get(i)]=howhow;
  				howhow++;
  				if(howhow>k) {
  					howhow=1;
  				}
  			}
  			for(int i=0;i<n;i++) {
  				System.out.print(brr[i]+" ");
  			}
  			System.out.println();
  			//System.out.println(Arrays.deepToString(adj));
  		}
  		//System.out.println();
  		//System.out.println(finalAnswer);
  	}
  	///////////////////////////////////////////////////////////////////
  	public static long gcd(long a, long b)
      {
        if (b == 0)
          return a;
        return gcd(b, a % b);
      }
  	private static long lcm(long a, long b)
  	{
  	    return a * (b / gcd(a, b));
  	}
  	static boolean containsDigit(int number, int digit)
  	{
  	    while (number > 0)
  	    {
  	        int curr_digit = number % 10;
  	        if (curr_digit == digit) return true;
  	        number /= 10;
  	    }
   
  	    return false;
  	}
  	static boolean isPalindrome(String s) {
  		  int n = s.length();
  		  for (int i = 0; i < (n/2); ++i) {
  		     if (s.charAt(i) != s.charAt(n - i - 1)) {
  		         return false;
  		     }
  		  }
   
  		  return true;
  	}
  	public static boolean IsPrime(long number)
      {
          if (number < 2) return false;
          if (number % 2 == 0) return (number == 2);
          long root = (int)Math.sqrt((double)number);
          for (int i = 3; i <= root; i += 2)
          {
              if (number % i == 0) return false;
          }
          return true;
      }
  	static long nCr(int n)
  	{
  	    return fact(n) / (fact(2) *
  	                  fact(n - 2));
  	}
  	 
  	// Returns factorial of n
  	static long fact(long n)
  	{
  	    long res = 1;
  	    for (int i = 2; i <= n; i++)
  	        res = res * i;
  	    return res;
  	}
  	static boolean[] sieveOfEratosthenes(int n)
      {
          // Create a boolean array
          // "prime[0..n]" and
          // initialize all entries
          // it as true. A value in
          // prime[i] will finally be
          // false if i is Not a
          // prime, else true.
  		//System.out.println(n+"n");
          boolean prime[] = new boolean[n + 1];
          for (int i = 0; i <= n; i++)
              prime[i] = true;
   
          for (int p = 2; p * p <= n; p++)
          {
              // If prime[p] is not changed, then it is a
              // prime
              if (prime[p] == true)
              {
                  // Update all multiples of p
                  for (int i = p * p; i <= n; i += p)
                      prime[i] = false;
              }
          }
          //System.out.println(Arrays.toString(prime));
          return prime;
      }
  	public static boolean hasDuplicates(String text){
          for(int i = 0; i < text.length() - 1; i++){
              for(int j = i + 1; j < text.length(); j ++){
                  if(text.charAt(i) == text.charAt(j)){
                      return true;
                  }
              }
          }
          return false;
      }
  }