particular integers x1,x2,… ,xn are composed on the board. Nezzar can play out the accompanying activity on numerous occasions. Select two integers x,y (not really particular) on the board, and record 2x−y. Note that you don't eliminate chosen numbers. Presently, Nezzar contemplates whether it is feasible to have his beloved number k on the load
Correct answer will be upvoted else downvoted. Computer science.
particular integers x1,x2,… ,xn are composed on the board. Nezzar can play out the accompanying activity on numerous occasions.
Select two integers x,y (not really particular) on the board, and record 2x−y. Note that you don't eliminate chosen numbers.
Presently, Nezzar contemplates whether it is feasible to have his beloved number k on the load up in the wake of applying above activity on different occasions.
Input
The primary line contains a solitary integer t (1≤t≤105) — the number of experiments.
The main line of each experiment contains two integers n,k (2≤n≤2⋅105, −1018≤k≤1018).
The second line of each experiment contains n unmistakable integers x1,x2,… ,xn (−1018≤xi≤1018).
It is ensured that the amount of n for all experiments doesn't surpass 2⋅105.
Output
For each experiment, print "YES" on a solitary line in case it is feasible to have k on the board. In any case, print "NO".
You can print each letter regardless (upper or lower).
Step by step
Solved in 4 steps with 1 images
