CF1656B.Subtract Operation

You are given a list of $n$ integers. You can perform the following operation: you choose an element $x$ from the list, erase $x$ from the list, and subtract the value of $x$ from all the remaining elements. Thus, in one operation, the length of the list is decreased by exactly $1$.

Given an integer $k$ ($k \gt 0$), find if there is some sequence of $n-1$ operations such that, after applying the operations, the only remaining element of the list is equal to $k$.

给你一个包含 $n$ 个整数的列表。你可以执行如下操作：从列表中选择一个元素 $x$，将其从列表中删除，并将所有剩余元素都减去 $x$ 的值。因此，每次操作恰好使列表长度减少 $1$。

给定一个正整数 $k$（即 $k \gt 0$），判断是否存在某种由 $n-1$ 次操作组成的序列，使得在执行完这些操作后，列表中唯一剩下的元素恰好等于 $k$。

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

The first line of each test case contains two integers $n$ and $k$ ($2 \leq n \leq 2\cdot 10^5$, $1 \leq k \leq 10^9$), the number of integers in the list, and the target value, respectively.

The second line of each test case contains the $n$ integers of the list $a_1, a_2, \ldots, a_n$ ($-10^9 \leq a_i \leq 10^9$).

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

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

每个测试用例的第一行包含两个整数 $n$ 和 $k$（$2 \leq n \leq 2\cdot 10^5$，$1 \leq k \leq 10^9$），分别表示列表中整数的个数和目标值。

每个测试用例的第二行包含该列表的 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$-10^9 \leq a_i \leq 10^9$）。

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

For each test case, print YES if you can achieve $k$ with a sequence of $n-1$ operations. Otherwise, print NO.

You may print each letter in any case (for example, "YES", "Yes", "yes", "yEs" will all be recognized as a positive answer).

对于每个测试用例，如果可以通过 $n-1$ 次操作得到 $k$，则输出 YES；否则输出 NO。

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

In the first example we have the list ${4, 2, 2, 7}$, and we have the target $k = 5$. One way to achieve it is the following: first we choose the third element, obtaining the list ${2, 0, 5}$. Next we choose the first element, obtaining the list ${-2, 3}$. Finally, we choose the first element, obtaining the list ${5}$.

在第一个例子中，我们有列表 ${4, 2, 2, 7}$，目标值为 $k = 5$。一种可行的操作方式如下：首先选择第三个元素，得到列表 ${2, 0, 5}$；接着选择第一个元素，得到列表 ${-2, 3}$；最后再选择第一个元素，得到列表 ${5}$。