CF1481C.Fence Painting

You finally woke up after this crazy dream and decided to walk around to clear your head. Outside you saw your house's fence — so plain and boring, that you'd like to repaint it.

You have a fence consisting of $n$ planks, where the $i$-th plank has the color $a_i$. You want to repaint the fence in such a way that the $i$-th plank has the color $b_i$.

You've invited $m$ painters for this purpose. The $j$-th painter will arrive at the moment $j$ and will recolor exactly one plank to color $c_j$. For each painter you can choose which plank to recolor, but you can't turn them down, i. e. each painter has to color exactly one plank.

Can you get the coloring $b$ you want? If it's possible, print for each painter which plank he must paint.

你终于从这场疯狂的梦境中醒来，决定四处走走，让头脑清醒一下。出门后，你看到了自家的篱笆——如此单调乏味，以至于你想给它重新刷漆。

你的篱笆由 $n$ 块木板组成，其中第 $i$ 块木板当前的颜色为 $a_i$。你希望将篱笆重刷成目标颜色序列 $b$，即第 $i$ 块木板最终颜色应为 $b_i$。

为此，你邀请了 $m$ 位油漆匠。第 $j$ 位油漆匠将在时刻 $j$ 到达，并恰好将一块木板重新涂成颜色 $c_j$。对于每位油漆匠，你可以自由选择他所涂的木板，但不能拒绝任何一位油漆匠，即每位油漆匠必须且仅能涂一块木板。

你能否得到期望的颜色序列 $b$？如果可以，请输出每位油漆匠应涂哪一块木板（即输出每位油漆匠操作的木板编号）；否则无需输出。

The first line contains one integer $t$ ($1 \le t \le 10^4$) — the number of test cases. Then $t$ test cases follow.

The first line of each test case contains two integers $n$ and $m$ ($1 \le n, m \le 10^5$) — the number of planks in the fence and the number of painters.

The second line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le n$) — the initial colors of the fence.

The third line of each test case contains $n$ integers $b_1, b_2, \dots, b_n$ ($1 \le b_i \le n$) — the desired colors of the fence.

The fourth line of each test case contains $m$ integers $c_1, c_2, \dots, c_m$ ($1 \le c_j \le n$) — the colors painters have.

It's guaranteed that the sum of $n$ doesn't exceed $10^5$ and the sum of $m$ doesn't exceed $10^5$ over all test cases.

第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 测试用例的数量。接下来是 $t$ 个测试用例。

每个测试用例的第一行包含两个整数 $n$ 和 $m$（$1 \le n, m \le 10^5$）—— 围栏中木板的数量和粉刷匠的数量。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le n$）—— 围栏的初始颜色。

每个测试用例的第三行包含 $n$ 个整数 $b_1, b_2, \dots, b_n$（$1 \le b_i \le n$）—— 围栏的目标颜色。

每个测试用例的第四行包含 $m$ 个整数 $c_1, c_2, \dots, c_m$（$1 \le c_j \le n$）—— 各粉刷匠所拥有的颜色。

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

For each test case, output "NO" if it is impossible to achieve the coloring $b$.

Otherwise, print "YES" and $m$ integers $x_1, x_2, \dots, x_m$, where $x_j$ is the index of plank the $j$-th painter should paint.

You may print every letter in any case you want (so, for example, the strings "yEs", "yes", "Yes" and "YES" are all recognized as positive answer).

对于每个测试用例，若无法实现目标染色方案 $b$，则输出 "NO"。

否则，输出 "YES" 以及 $m$ 个整数 $x_1, x_2, \dots, x_m$，其中 $x_j$ 表示第 $j$ 位画家应涂色的木板编号。

你可以以任意大小写形式输出每个字母（例如，字符串 "yEs"、"yes"、"Yes" 和 "YES" 均被视为肯定回答）。