# Jam's balance

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

## Description

Jim has a balance and N weights. $(1 \leq N \leq 20)$
The balance can only tell whether things on different side are the same weight.
Weights can be put on left side or right side arbitrarily.
Please tell whether the balance can measure an object of weight M.

## Input

The first line is a integer $T(1 \leq T \leq 5)$, means T test cases.
For each test case :
The first line is $N$, means the number of weights.
The second line are $N$ number, i'th number $w_i (1 \leq w_i \leq 100)$ means the i'th weight's weight is $w_i$.
The third line is a number $M$. $M$ is the weight of the object being measured.

## Output

You should output the "YES"or"NO".

## Sample Input

1
2
1 4
3
2
4
5

## Sample Output

NO
YES
YES

Hint
For the Case 1:Put the 4 weight alone
For the Case 2:Put the 4 weight and 1 weight on both side 

hujie

## Source

BestCoder Round #70