have an exhibit a1,a2,… ,an. All man-made intelligence are positive integers. In one stage you can pick three unmistakable lists I, j, and k (i≠j; i≠k; j≠k) and allot the amount of aj and ak to simulated intelligence, I. e. make ai=aj+ak. Would you be able to make all man-made intelligence lower or
Correct answer will be upvoted else downvoted. Computer science.
You have an exhibit a1,a2,… ,an. All man-made intelligence are positive integers.
In one stage you can pick three unmistakable lists I, j, and k (i≠j; i≠k; j≠k) and allot the amount of aj and ak to simulated intelligence, I. e. make
Would you be able to make all man-made intelligence lower or equivalent to d utilizing the activity over quite a few times (conceivably, zero)?
Input
The principal line contains a solitary integer t (1≤t≤2000) — the number of experiments.
The principal line of each experiment contains two integers n and d (3≤n≤100; 1≤d≤100) — the number of components in the cluster an and the worth d.
The subsequent line contains n integers a1,a2,… ,an (1≤ai≤100) — the cluster a.
Output
For each experiment, print YES, in the event that it's feasible to make all components simulated intelligence less or equivalent than d utilizing the activity above. In any case, print NO.
You might print each letter regardless (for instance, YES, Yes, indeed, yEs will be in every way perceived as certain reply).
Step by step
Solved in 4 steps with 1 images
