CF1515C.Phoenix and Towers

Phoenix has $n$ blocks of height $h_1, h_2, \dots, h_n$, and all $h_i$ don't exceed some value $x$. He plans to stack all $n$ blocks into $m$ separate towers. The height of a tower is simply the sum of the heights of its blocks. For the towers to look beautiful, no two towers may have a height difference of strictly more than $x$.

Please help Phoenix build $m$ towers that look beautiful. Each tower must have at least one block and all blocks must be used.

凤凰有 $n$ 个高度分别为 $h_1, h_2, \dots, h_n$ 的方块，且所有 $h_i$ 均不超过某个值 $x$。他计划将全部 $n$ 个方块堆成 $m$ 座独立的塔。一座塔的高度即为其所含方块高度之和。为使这些塔看起来美观，任意两座塔的高度差严格不得超过 $x$。

请帮助凤凰建造 $m$ 座美观的塔。每座塔至少需包含一个方块，且所有方块都必须被使用。

The input consists of multiple test cases. The first line contains an integer $t$ ($1 \le t \le 1000$) — the number of test cases.

The first line of each test case contains three integers $n$, $m$, and $x$ ($1 \le m \le n \le 10^5$; $1 \le x \le 10^4$) — the number of blocks, the number of towers to build, and the maximum acceptable height difference of any two towers, respectively.

The second line of each test case contains $n$ space-separated integers ($1 \le h_i \le x$) — the heights of the blocks.

It is guaranteed that the sum of $n$ over all the test cases will not exceed $10^5$.

输入包含多个测试用例。第一行包含一个整数 $t$（$1 \le t \le 1000$），表示测试用例的数量。

每个测试用例的第一行包含三个整数 $n$、$m$ 和 $x$（$1 \le m \le n \le 10^5$；$1 \le x \le 10^4$），分别表示方块的数量、需建造的塔的数量，以及任意两座塔之间可接受的最大高度差。

每个测试用例的第二行包含 $n$ 个以空格分隔的整数（$1 \le h_i \le x$），表示各块的高度。

保证所有测试用例中 $n$ 的总和不超过 $10^5$。

For each test case, if Phoenix cannot build $m$ towers that look beautiful, print NO. Otherwise, print YES, followed by $n$ integers $y_1, y_2, \dots, y_n$, where $y_i$ ($1 \le y_i \le m$) is the index of the tower that the $i$-th block is placed in.

If there are multiple solutions, print any of them.

对于每个测试用例，如果凤凰无法建造 $m$ 座美观的塔，则输出 NO。否则，输出 YES，然后输出 $n$ 个整数 $y_1, y_2, \dots, y_n$，其中 $y_i$（$1 \le y_i \le m$）表示第 $i$ 个方块所放置的塔的编号。

如果存在多种解法，输出任意一种即可。

In the first test case, the first tower has height $1+2+3=6$ and the second tower has height $1+2=3$. Their difference is $6-3=3$ which doesn't exceed $x=3$, so the towers are beautiful.

In the second test case, the first tower has height $1$, the second tower has height $1+2=3$, and the third tower has height $3$. The maximum height difference of any two towers is $3-1=2$ which doesn't exceed $x=3$, so the towers are beautiful.

在第一个测试用例中，第一座塔的高度为 $1+2+3=6$，第二座塔的高度为 $1+2=3$。它们的高度差为 $6-3=3$，未超过 $x=3$，因此这些塔是优美的。

在第二个测试用例中，第一座塔的高度为 $1$，第二座塔的高度为 $1+2=3$，第三座塔的高度为 $3$。任意两座塔之间的最大高度差为 $3-1=2$，未超过 $x=3$，因此这些塔是优美的。