Description

UIM plays a MOBA game in their spare time while coding.

When an enemy minion enters the range of our turret, it will continuously take damage from the turret. Of course, our hero can also deal damage to it. When the minion's HP drops to $0$ or below, it will be killed. To gain experience, UIM wants to personally last hit the minion before the turret kills it.

To simplify the problem, suppose the minion has $h$ HP. Each turret attack deals $x$ damage to the minion, and each hero attack deals $y$ damage. Your attack speed is the same as the turret's, so you may choose to attack the minion once before the turret's first attack, or once after each turret attack. Of course, you may also choose not to attack.

Now, given this information, determine whether the hero has a way to kill this minion.

Input Format

Each test file contains multiple test cases.

The first line contains a positive integer $T$, indicating the number of test cases.

The next $T$ lines each contain three non-negative integers $h, x, y$, whose meanings are given in the description.

Output Format

Output $T$ lines. For each test case, if you can kill the minion in the end, output Yes; otherwise output No.

5
100 100 1
100 97 1
100 98 1
100 99 1
100 100 0

No
No
Yes
Yes
No

Hint

The number of test cases does not exceed $50$. $1 \le h \le 10^{18}$, $0 \le x, y \le 10^{18}$.

Translated by ChatGPT 5