CF1786B.Cake Assembly Line

A cake assembly line in a bakery was once again optimized, and now $n$ cakes are made at a time! In the last step, each of the $n$ cakes should be covered with chocolate.

Consider a side view on the conveyor belt, let it be a number line. The $i$-th cake occupies the segment $[a_i - w, a_i + w]$ on this line, each pair of these segments does not have common points. Above the conveyor, there are $n$ dispensers, and when a common button is pressed, chocolate from the $i$-th dispenser will cover the conveyor segment $[b_i - h, b_i + h]$. Each pair of these segments also does not have common points.

Cakes and dispensers corresponding to the first example.

The calibration of this conveyor belt part has not yet been performed, so you are to make it. Determine if it's possible to shift the conveyor so that each cake has some chocolate on it, and there is no chocolate outside the cakes. You can assume that the conveyour is long enough, so the cakes never fall. Also note that the button can only be pressed once.

In the first example we can shift the cakes as shown in the picture.

一家面包店的蛋糕装配线再次经过优化，现在每次可同时制作 $n$ 个蛋糕！在最后一步中，这 $n$ 个蛋糕中的每一个都需覆盖上巧克力。

考虑传送带的侧视图，将其建模为一条数轴。第 $i$ 个蛋糕在该数轴上占据区间 $[a_i - w, a_i + w]$，且这些区间两两互不相交。传送带正上方安装有 $n$ 个巧克力分配器；当按下统一按钮时，第 $i$ 个分配器喷出的巧克力将覆盖传送带上的区间 $[b_i - h, b_i + h]$，且这些区间也两两互不相交。

与第一个样例对应的蛋糕和分配器。

该传送带部分尚未完成校准，因此需要你来完成。请判断：是否存在一种对传送带的平移方式（即整体移动所有蛋糕），使得每个蛋糕上均被覆盖有巧克力，且巧克力完全不落在蛋糕之外？你可以假设传送带足够长，蛋糕不会掉落。另外请注意：按钮仅能按压一次。

在第一个样例中，我们可以按图示方式平移蛋糕。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^5$). The description of the test cases follows.

The first line of each test case contains three integers $n$, $w$, and $h$ ($1 \le n \le 10^5$; $1 \le w, h \le 10^5$; $h \le w$) — the number of cakes and dispensers, as well as the halfwidths of cakes and segments on which the chocolate is dispensed.

The second line contains $n$ integers $a_1$, $a_2$, ..., $a_n$ ($1 \le a_i \le 10^9$) — the positions of the cakes centers. It is guaranteed that $a_i + w \lt a_{i + 1} - w$ for all $i$.

The third line contains $n$ integers $b_1$, $b_2$, ..., $b_n$ ($1 \le b_i \le 10^9$) — the positions of the dispensers. It is guaranteed that $b_i + h \lt b_{i + 1} - h$ for all $i$.

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

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 10^5$）。随后是各测试用例的描述。

每个测试用例的第一行包含三个整数 $n$、$w$ 和 $h$（$1 \le n \le 10^5$；$1 \le w, h \le 10^5$；$h \le w$）——分别表示蛋糕数量、分配器数量，以及蛋糕的半宽和巧克力分配区段的半宽。

每个测试用例的第二行包含 $n$ 个整数 $a_1$、$a_2$、…、$a_n$（$1 \le a_i \le 10^9$）——表示各蛋糕中心的位置。保证对所有 $i$ 均满足 $a_i + w \lt a_{i + 1} - w$。

每个测试用例的第三行包含 $n$ 个整数 $b_1$、$b_2$、…、$b_n$（$1 \le b_i \le 10^9$）——表示各分配器的位置。保证对所有 $i$ 均满足 $b_i + h \lt b_{i + 1} - h$。

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

For each test case output "YES", if it's possible to shift the conveyor in such a way that each cake ends up with some chocolate, and no chocolate is outside the cakes, and "NO" otherwise.

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.

对于每个测试用例，如果能够以某种方式平移传送带，使得每块蛋糕上都恰好覆盖有巧克力，且巧克力不会超出任何蛋糕的范围，则输出 “YES”；否则输出 “NO”。

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

The first example is shown in the figures in the statement.

In the second example, we can move the conveyor, for example, so that the centers of the cakes are at $4, 9, 14, 19, 24$.

In the third example, we can't move the conveyor accordingly.

第一个示例如题面中的图所示。

在第二个示例中，我们可以移动传送带，例如使蛋糕中心的位置分别为 $4, 9, 14, 19, 24$。

在第三个示例中，我们无法相应地移动传送带。