CF1779D.Boris and His Amazing Haircut

Boris thinks that chess is a tedious game. So he left his tournament early and went to a barber shop as his hair was a bit messy.

His current hair can be described by an array $a_1,a_2,\ldots, a_n$, where $a_i$ is the height of the hair standing at position $i$. His desired haircut can be described by an array $b_1,b_2,\ldots, b_n$ in a similar fashion.

The barber has $m$ razors. Each has its own size and can be used at most once. In one operation, he chooses a razor and cuts a segment of Boris's hair. More formally, an operation is:

• Choose any razor which hasn't been used before, let its size be $x$;
• Choose a segment $[l,r]$ ($1\leq l \leq r \leq n$);
• Set $a_i := \min (a_i,x)$ for each $l\leq i \leq r$;

Notice that some razors might have equal sizes — the barber can choose some size $x$ only as many times as the number of razors with size $x$.

He may perform as many operations as he wants, as long as any razor is used at most once and $a_i = b_i$ for each $1 \leq i \leq n$ at the end. He does not have to use all razors.

Can you determine whether the barber can give Boris his desired haircut?

鲍里斯认为国际象棋是一项枯燥乏味的游戏，因此他提前离开了比赛，去了一家理发店——因为他的头发有点乱。

他当前的发型可用一个数组 $a_1,a_2,\ldots, a_n$ 描述，其中 $a_i$ 表示位置 $i$ 处头发的高度。他期望的发型则可用类似方式描述为数组 $b_1,b_2,\ldots, b_n$。

理发师有 $m$ 把剃刀，每把剃刀具有各自的尺寸，且最多只能使用一次。每次操作中，他选择一把剃刀并修剪鲍里斯头发的一段区域。更准确地说，一次操作定义如下：

• 任选一把尚未使用过的剃刀，设其尺寸为 $x$；
• 任选一个区间 $[l,r]$（满足 $1\leq l \leq r \leq n$）；
• 对每个满足 $l\leq i \leq r$ 的下标 $i$，令 $a_i := \min (a_i,x)$；

注意：某些剃刀可能具有相同的尺寸——理发师最多只能对尺寸 $x$ 执行与尺寸为 $x$ 的剃刀数量相等次数的操作。

他可以执行任意多次操作，只要满足：每把剃刀至多使用一次，且最终对所有 $1 \leq i \leq n$ 均有 $a_i = b_i$。他不必使用全部剃刀。

你能判断理发师是否能为鲍里斯理出他期望的发型吗？

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \leq t \leq 20\,000$). The description of the test cases follows.

The first line of each test case contains a positive integer $n$ ($3\leq n\leq 2\cdot 10^5$) — the length of arrays $a$ and $b$.

The second line of each test case contains $n$ positive integers $a_1, a_2, \ldots, a_n$ ($1 \leq a_i \leq 10^9$) — Boris's current hair.

The third line of each test case contains $n$ positive integers $b_1, b_2, \ldots, b_n$ ($1 \leq b_i \leq 10^9$) — Boris's desired hair.

The fourth line of each test case contains a positive integer $m$ ($1 \leq m \leq 2\cdot 10^5$) — the number of razors.

The fifth line of each test case contains $m$ positive integers $x_1,x_2, \ldots, x_m$ ($1 \leq x_i \leq 10^9$) — the sizes of the razors.

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

每个测试包含多个测试用例。第一行包含测试用例数量 $t$（$1 \leq t \leq 20\,000$）。随后是各测试用例的描述。

每个测试用例的第一行包含一个正整数 $n$（$3\leq n\leq 2\cdot 10^5$）—— 数组 $a$ 和 $b$ 的长度。

每个测试用例的第二行包含 $n$ 个正整数 $a_1, a_2, \ldots, a_n$（$1 \leq a_i \leq 10^9$）—— Boris 当前的发型。

每个测试用例的第三行包含 $n$ 个正整数 $b_1, b_2, \ldots, b_n$（$1 \leq b_i \leq 10^9$）—— Boris 理想的发型。

每个测试用例的第四行包含一个正整数 $m$（$1 \leq m \leq 2\cdot 10^5$）—— 剃刀的数量。

每个测试用例的第五行包含 $m$ 个正整数 $x_1,x_2, \ldots, x_m$（$1 \leq x_i \leq 10^9$）—— 剃刀的尺寸。

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

For each test case, print "YES" if the barber can cut Boris's hair as desired. Otherwise, print "NO".

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

对于每个测试用例，如果理发师能够按照 Boris 的要求为其剪发，则输出 “YES”；否则输出 “NO”。

您可以以任意大小写形式输出答案（大写或小写均可）。例如，字符串 “yEs”、“yes”、“Yes” 和 “YES” 均会被识别为肯定回答。

In the first test case, Boris's hair is initially $[3,3,3]$. Let us describe a sequence of $2$ operations the barber can perform:

• The barber uses the razor with size $1$ on the segment $[2,2]$; hence Boris's hair becomes $[3,1,3]$.
• The barber uses the razor with size $2$ on the segment $[1,3]$; hence Boris's hair becomes $[2,1,2]$ which is the desired haircut.

In the third test case, no operation has to be done since Boris's hair is already as desired.

In the fourth test case, no cuts will be able to increase the third element in $[1,1,1]$ in a way that the array becomes $[1,1,2]$.

在第一个测试用例中，Boris 的头发初始为 $[3,3,3]$。下面描述理发师可以执行的一组共 $2$ 次操作：

• 理发师在区间 $[2,2]$ 上使用尺寸为 $1$ 的剃刀；因此 Boris 的头发变为 $[3,1,3]$。
• 理发师在区间 $[1,3]$ 上使用尺寸为 $2$ 的剃刀；因此 Boris 的头发变为 $[2,1,2]$，即目标发型。

在第三个测试用例中，无需执行任何操作，因为 Boris 的头发已符合要求。

在第四个测试用例中，无法通过任何剪发操作使 $[1,1,1]$ 中的第三个元素增大，从而将数组变为 $[1,1,2]$。