B'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: E. xe2 x80 x89g. 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. Help Paul and Mary to find a wonderful coloring of a given sequence a . 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 cdot10^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 cdot 10^5 . 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 Remember that you need to maximize the total count of painted elements for the wonderful coloring. If there are multiple solutions, print any one. 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 . '...