Time Limit: 2000 MS Memory Limit: 65536 K

## Description

The definition of Reducible Array {A_{0}, A_{1}, A_{2}, бн, A_{N-1}}
can be showed as follow:
1. An array {A_{x}} consisting of only one element cannot
be reduced, and A_{x} is the target.
2. Otherwise, any element A_{i} ( 0 <= i <= N-2 ) of the array
{A_{0}, A_{1}, A_{2}, бн, A_{N-1}} can be reduced to a smaller array
by replacing A_{i} and A_{i+1} with the subtraction of A_{i}
and A_{i+1}, namely A_{i}-A_{i+1}.
For example, the procedure that {12, 10, 4, 3, 5} reduces
to {4}, the target, can be illustrated as:
{12, 10, 4, 3, 5}
{12, 6, 3, 5}
{12, 6, -2}
{12, 8}
{4}
Obviously, there are many different targets of a Reducible
Array, varying according to different orders the reducing
procedures adopted.
Now, Rain want to know whether there is such an order that,
if the reducing procedure is adopted,
would result in a given target M.
## Input

The first line of input is the number of test case.
For each test case:
The first line contains two integers N and M.
The second line contains N integers.
There is a blank line before each test case.
3 <= N <= 20
-2^{31} <= M <= 2^{31}-1
-10^{8} <= A_{i} <= 10^{8}
## Output

For each test case output the answer on a single line:
"Yes" or "No".
## Sample Input

2
5 4
12 10 4 3 5
5 7
12 10 4 3 5
## Sample Output

Yes
No
## Source

8th SCUPC
## Author

windy7926778