CF397B On Corruption and Numbers

Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants to get. At school, he had bad grades in all subjects, and it's only thanks to wealthy parents that he was able to obtain the graduation certificate. The situation is complicated by the fact that each high education institution has the determined amount of voluntary donations, paid by the new students for admission — $ n_{i} $ berubleys. He cannot pay more than $ n_{i} $ , because then the difference between the paid amount and $ n_{i} $ can be regarded as a bribe! Each rector is wearing the distinctive uniform of his university. Therefore, the uniform's pockets cannot contain coins of denomination more than $ r_{i} $ . The rector also does not carry coins of denomination less than $ l_{i} $ in his pocket — because if everyone pays him with so small coins, they gather a lot of weight and the pocket tears. Therefore, a donation can be paid only by coins of denomination $ x $ berubleys, where $ l_{i}

The first line contains the number of universities $ t $ , ( $ 1

For each query print on a single line: either "Yes", if Alexey can enter the university, or "No" otherwise.

You can pay the donation to the first university with two coins: one of denomination 2 and one of denomination 3 berubleys. The donation to the second university cannot be paid.