Dr. Jackal has finally found a way to spread darkness all over the planet so he starts his Ducati Streetfighter 848 in order to reach Tamraj Kilvish ASAP.

Meanwhile some dude texted Gangadhar about this evil plan so he started his great grandfather's scooter for chasing Dr. Jackal. The problem with this little chase is :

Thanks to his great grandfather, Gangadhar's scooter doesn't have an accelerator.

Thanks to all the black money Tamraj Kilvish is laundering, Ducati Streetfighter 848 can maintain a constant acceleration.

Initially Gangadhar is d distance away from Dr. Jackal

Input:

The first line of input contains an integer T denoting the number of test cases.

Each line of test case contains 3 space separated integers v, d, a where v is speed of Gangadhar's scooter, d is initial distance b/w them and a is acceleration of the Ducati.

Output:

For each test case, in a new line, print "YES" if Gangadhar catches Dr. Jackal or "NO" if he doesn't.

Constraints:

$1\le T \le 100$

$0\le v,d,a \le 10^{18}$