CF1893D.Colorful Constructive

You have $n$ colored cubes, the $i$-th cube has color $a_i$.

You need to distribute all the cubes on shelves. There are a total of $m$ shelves, the $i$-th shelf can hold $s_i$ cubes. Also, $s_1 + s_2 + \ldots + s_m = n$.

Suppose on a shelf of size $k$ there are cubes of colors $c_1, c_2, \ldots, c_k$, in this order. Then we define the colorfulness of the shelf as the minimum distance between two different cubes of the same color on the shelf. If all the cubes on the shelf have different colors, then the colorfulness is considered to be equal to the size of the shelf, that is, the number $k$.

More formally, the colorfulness of $c_1, c_2, \ldots, c_k$ is defined as follows:

• If all the colors $c_1, c_2, \ldots, c_k$ are different, the colorfulness is considered to be $k$.
• Otherwise, the colorfulness is considered to be the smallest integer $x \geq 1$ such that there exists an index $i$ $(1 \le i \le k - x)$ such that $c_i = c_{i+x}$.

For each shelf, you are given the minimum required colorfulness, that is, you are given numbers $d_1, d_2, \ldots, d_m$, which mean that shelf $i$ must have a colorfulness $\geq d_i$ for all $i$.

Distribute the available cubes among the shelves to ensure the required colorfulness, or report that it is impossible.

你有 $n$ 个彩色立方体，其中第 $i$ 个立方体的颜色为 $a_i$。

你需要将所有立方体分配到书架上。一共有 $m$ 个书架，其中第 $i$ 个书架最多可容纳 $s_i$ 个立方体。此外，满足 $s_1 + s_2 + \ldots + s_m = n$。

假设一个容量为 $k$ 的书架上按顺序摆放着颜色为 $c_1, c_2, \ldots, c_k$ 的立方体，则该书架的“色彩丰富度”（colorfulness）定义为：该书架上任意两个颜色相同但位置不同的立方体之间的最小距离。若该书架上所有立方体颜色互不相同，则其色彩丰富度定义为该书架的容量，即整数 $k$。

更形式化地，序列 $c_1, c_2, \ldots, c_k$ 的色彩丰富度定义如下：

• 若所有颜色 $c_1, c_2, \ldots, c_k$ 互不相同，则色彩丰富度为 $k$；
• 否则，色彩丰富度为满足如下条件的最小整数 $x \geq 1$：存在下标 $i$（满足 $1 \le i \le k - x$），使得 $c_i = c_{i+x}$。

对每个书架，题目给出其所需的最小色彩丰富度，即给定整数 $d_1, d_2, \ldots, d_m$，表示第 $i$ 个书架的色彩丰富度必须满足 $\geq d_i$（对所有 $i$）。

请将给定的立方体分配到各书架上，使其满足所有 $d_i$ 的约束；若无法实现，请报告无解。

Each test contains multiple test cases. The first line contains a single integer $t$ $(1 \leq t \leq 10^4)$ — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers $n, m$ $(1 \leq m \leq n \leq 2 \cdot 10^5)$ — the number of cubes and the number of shelves to distribute them to.

The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ $(1 \leq a_i \leq n)$ — the colors of the cubes.

The third line of each test case contains $m$ integers $s_1, s_2, \ldots, s_m$ $(1 \leq s_i \leq n)$ — the sizes of the shelves. It's guaranteed, that $s_1 + \ldots + s_m = n$.

The fourth line of each test case contains $m$ integers $d_1, d_2, \ldots, d_m$ $(1 \leq d_i \leq s_i)$ — the minimum required colorfulness of the shelves.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10^5$.

每个测试包含多个测试用例。第一行包含一个整数 $t$（$1 \leq t \leq 10^4$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含两个整数 $n, m$（$1 \leq m \leq n \leq 2 \cdot 10^5$），分别表示立方体的数量以及用于放置这些立方体的架子数量。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \leq a_i \leq n$），表示各立方体的颜色。

每个测试用例的第三行包含 $m$ 个整数 $s_1, s_2, \ldots, s_m$（$1 \leq s_i \leq n$），表示各架子的容量。保证 $s_1 + \ldots + s_m = n$。

每个测试用例的第四行包含 $m$ 个整数 $d_1, d_2, \ldots, d_m$（$1 \leq d_i \leq s_i$），表示各架子所需的最小“色彩丰富度”。

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

For each test case, if it is impossible to distribute the cubes on the shelves satisfying all the requirements, output a single number $-1$. Otherwise, output $m$ lines, where the $i$-th line should contain $s_i$ numbers representing the colors of the cubes on the $i$-th shelf, in the appropriate order.

对于每个测试用例，如果无法在满足所有要求的前提下将立方体分配到书架上，则输出单个数字 $-1$。否则，输出 $m$ 行，其中第 $i$ 行应包含 $s_i$ 个数字，表示第 $i$ 个书架上立方体的颜色（按适当顺序排列）。