That is the question. Tom Dickson is in charge of the channel Blendtec which is in charge of blending, well, basically anything that can be find, or blend.

Mr. Tom don’t want to fail his public on the next show in Madrid, so he is asking the URJC if, given the blender power he is bringing in and some items, whether these items will or will not blend.

Input

The first line contains an integer T, which specifies the number of test cases. Then, will follow the descriptions of T test cases.

For each test case you will receive two integers N and K denoting the number of items to follow and the power of the blender, then, N lines will follow with a single integer Ni denoting the power needed to blend the item.

Output

For each test case you must print N lines with a string ”Yes, it blends!” if the blender power exceeds the power needed to blend the item, if this is not true, you should print ”Well, it mostly blended” (quotes only for clarification)

Example

Input:
2
3 5
1
200
4
2 5000
4999
5000

Output:
Yes, it blends!
Well, it mostly blended
Yes, it blends!
Yes, it blends!
Well, it mostly blended

Constraints

• 1 ≤ N ≤ 1,000
• 1 ≤ K ≤ 1,000,000,000
• 1 ≤ Ni ≤ 1,000,000,000