Fidan’s training

Fidan prepared well for the first IDDA Cup competition. She told her friends that she solved $n$ tasks in total over $y$ days by solving at most $x$ tasks per day. Leyla, being skeptical, wants to verify the feasibility of Fidan’s claim and seeks your help in writing a program to do so.

Input

The first line contains a single integer $t(1\le t\le 1000)$, denoting the number of test cases.

Each test case consists of a single line containing three integers: $n(1\le n\le 100),x$, and $y(1\le x,y\le 10)$. Here, $n$ represents the total number of tasks solved by Fidan, while $x$ denotes the maximum number of tasks she was solving daily, and $y$ signifies the duration, in days, over which the tasks were solved.

Output

For each test case, on a new line, print "YES", if Fidan’s claim is true and “NO" otherwise. You may print each character of the string in uppercase or lowercase. For example, "Yes", "YES", "yes", and "yES" are all considered iden!cal.

Examples

Test case $1$: Fidan can solve two tasks on the first day, two on the second day, and the remaining one on the third day.

Test case $2$: Fidan cannot complete all ten tasks in three days.

Test case $3$: Fidan can solve all seven tasks in one day.

Test case $4$: Fidan cannot complete all three tasks in one day.

Scoring

In this task, points are awarded for each correct test. The maximum score is $100$.