n guys have been involved into a death game. The game runs as follows: The n guys are brought into a penetralium, and they are forced to drink a fatal （致命的）poison. There are m locked cells in the penetralium. Only one of them contains the real antidote（解药）, and the participants have no idea where exactly the antidote is, and they only have one chance to open one of the cell. They could find the real antidote by tasting the samples before each cell and judging from their reactions to the samples. It’s assured that the samples are enough for tasting and they can be divided into many parts, but the content（含量）the sample contains is not enough to detoxify（解毒）anyone. If one drinks the sample containing the antidote, he/she would react to the antidote within 10 minutes, but if they don’t find the antidote, they would die 10 minutes later. Though the game designer is quite evil, he still wants to leave a chance to the participants, so please help with judging when there are n participants and m cells, can the participants get a chance to survive?

The first line has a integer t(t<=10000), representing the case number. Then follows t lines, each line has two numbers n and m, representing the number of participants and the number of cells.(n,m are in the range of long integer)

For each case, if the case if feasible, output “Yes”, else output “No”.