Geralt is an expert in crafting bombs. He has recently purchased a lot of raw material and has decided to make as many bombs as possible. After crafting all the bombs, he has come to the conclusion that he can't take all the bombs with him. So, he has to place these extra bombs in a stash. This stash is in the shape of a cylinder. Since, he likes doing unusual things, he only wants to place the bombs such that each one touches the curved boundary of the stash. Also, he doesn't want to place any bomb on top of another bomb. Help him in finding if he can place bombs in this way or not given that radius of stash is R and number of extra bombs is n and each one is of radius r.

Input Format--

First line contains t, number of test cases.

Each of the next t lines contains n, r and R, number of bombs to be placed, radius of each bomb and radius of the cylindrical stash.

Output Format--

Output t lines with each line containing output to corresponding test case.

Output "yes" if it is possible to place all n bombs and "no" otherwise.

Constraints--

$1 \leq t \leq 100$

$1 \leq n \leq 100$

$1 \leq r, R \leq 1000$