CF1763B.Incinerate

To destroy humanity, The Monster Association sent $n$ monsters to Earth's surface. The $i$-th monster has health $h_i$ and power $p_i$.

With his last resort attack, True Spiral Incineration Cannon, Genos can deal $k$ damage to all monsters alive. In other words, Genos can reduce the health of all monsters by $k$ (if $k \gt 0$) with a single attack.

However, after every attack Genos makes, the monsters advance. With their combined efforts, they reduce Genos' attack damage by the power of the $^\dagger$weakest monster $^\ddagger$alive. In other words, the minimum $p_i$ among all currently living monsters is subtracted from the value of $k$ after each attack.

$^\dagger$The Weakest monster is the one with the least power.

$^\ddagger$A monster is alive if its health is strictly greater than $0$.

Will Genos be successful in killing all the monsters?

为了毁灭人类，怪人协会向地球表面派遣了 $n$ 只怪人。第 $i$ 只怪人的生命值为 $h_i$，力量值为 $p_i$。

金木研使用其最终奥义——“真·螺旋焚灭炮”，可对所有现存怪人造成 $k$ 点伤害。换言之，金木研单次攻击可将所有现存怪人的生命值同时减少 $k$（若 $k > 0$）。

然而，金木研每次发动攻击后，怪人们便会协同进化并削弱金木研的攻击力——削弱量等于当前所有存活怪人中力量值最小者的力量值。换言之，每次攻击后，$k$ 的值将减去当前所有存活怪人中最小的 $p_i$ 值。

$^\dagger$所谓“最弱怪人”，即力量值 $p_i$ 最小的怪人。
$^\ddagger$一只怪人被视为“存活”，当且仅当其生命值严格大于 $0$。

金木研能否成功消灭所有怪人？

The first line of the input contains a single integer $t$ ($1 \le t \le 100$) — the number of test cases. The description of test cases follows.

The first line of each test case contains two integers, $n$ and $k$ ($1 \le n, k \le 10^5$) — the number of monsters and Genos' initial attack damage. Then two lines follow, each containing $n$ integers describing the arrays $h$ and $p$ ($1 \le h_i, p_i \le 10^9$).

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

输入的第一行包含一个整数 $t$（$1 \le t \le 100$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含两个整数 $n$ 和 $k$（$1 \le n, k \le 10^5$），分别表示怪物数量和 Genos 的初始攻击力。接下来两行，每行包含 $n$ 个整数，分别描述数组 $h$ 和 $p$（$1 \le h_i, p_i \le 10^9$）。

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

For each test case, print the answer — "YES" (without quotes) if Genos could kill all monsters and "NO" otherwise.

对于每个测试用例，输出答案——如果 Genos 能够杀死所有怪物，则输出 "YES"（不带引号），否则输出 "NO"。

In the first example, after Genos' first attack, $h$ and $k$ will update to:

• $h: [11,0,6,2,3,0]$
• $k: 7-1 = 6$

After second attack:

• $h: [5,0,0,0,0,0]$
• $k: 6-2 = 4$

After third attack:

• $h: [1,0,0,0,0,0]$
• $k: 4-2 = 2$

After fourth attack:

• $h: [0,0,0,0,0,0]$

As Genos could kill all monsters, the answer is YES.

在第一个例子中，Genos 第一次攻击后，$h$ 和 $k$ 将更新为：

• $h: [11,0,6,2,3,0]$
• $k: 7-1 = 6$

第二次攻击后：

• $h: [5,0,0,0,0,0]$
• $k: 6-2 = 4$

第三次攻击后：

• $h: [1,0,0,0,0,0]$
• $k: 4-2 = 2$

第四次攻击后：

• $h: [0,0,0,0,0,0]$

由于 Genos 能够消灭所有怪物，答案为 YES。