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 os
  import sys
  from io import BytesIO, IOBase
  
  _print = print
  BUFSIZE = 8192
  
  
  def dbg(*args, **kwargs):
      _print('\33[95m', end='')
      _print(*args, **kwargs)
      _print('\33[0m', end='')
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = 'x' in file.mode or 'r' not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b'\n') + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode('ascii'))
          self.read = lambda: self.buffer.read().decode('ascii')
          self.readline = lambda: self.buffer.readline().decode('ascii')
  
  
  def inp():
      return sys.stdin.readline().rstrip()
  
  
  def mpint():
      return map(int, inp().split(' '))
  
  
  def itg():
      return int(inp())
  
  
  # ############################## import
  from collections import Counter, defaultdict
  
  
  def to_table(iterable):
      d = defaultdict(lambda: [])
      for i, e in enumerate(iterable):
          d[e].append(i)
      return d
  
  
  # ############################## main
  
  
  def solve():
      n, k = mpint()
      arr = tuple(mpint())
      counter = Counter(arr)
      big = frozenset(filter(lambda key: counter[key] >= k, counter))
      small = frozenset(counter) - big
      small_num = sum(map(counter.__getitem__, small))
      small_num -= small_num % k
  
      ans = [0] * n
      table = to_table(arr)
      for b in big:
          for color, idx in enumerate(table[b][:k], 1):
              ans[idx] = color
      color = 0
      for s in small:
          for idx in table[s]:
              if not small_num:
                  break
              small_num -= 1
              color = (color + 1) % k
              ans[idx] = color + 1
          else:
              continue
          break
      check = Counter(ans)
      del check[0]
      assert len(frozenset(check.values())) == 1
      return ans
  
  
  def main():
      # print(solve())
      for _ in range(itg()):
          print(*solve())
          # solve()
          # print("YES" if solve() else "NO")
          # print("yes" if solve() else "no")
  
  
  DEBUG = 0
  URL = 'https://codeforces.com/contest/1551/problem/B2'
  
  if __name__ == '__main__':
      # 0: normal, 1: runner, 2: debug, 3: interactive
      if DEBUG == 1:
          import requests
          from ACgenerator.Y_Test_Case_Runner import TestCaseRunner
  
          runner = TestCaseRunner(main, URL)
          inp = runner.input_stream
          print = runner.output_stream
          runner.checking()
      else:
          if DEBUG != 2:
              dbg = lambda *args, **kwargs: ...
              sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
          if DEBUG == 3:
              def print(*args, **kwargs):
                  _print(*args, **kwargs)
                  sys.stdout.flush()
          main()
  # Please check!
  