This news headline has been echoing in Chef’s mind since 2009 when he started his career in sprinting. This time in the 20212021 Tokyo Olympics he is determined to make a new world record.

There are mainly 33 important factors that result in the variation in speed during practice and during competition.

- The first factor is a difference in track material which results in variation in the speed at competition with respect to practice by a factor of k1k1.
- The second factor is wind speed which results in variation in the speed at competition with respect to practice by a factor of k2k2.
- The final factor is the maximum speed achieved during practice. If the maximum speed during practice is vv m/s then in competition it will be k3∗vk3∗v m/s.

Given Chef’s max speed vv during practice and the factors k1,k2,k3k1,k2,k3, find whether he will be able to create a new world record, i.e, can he complete 100100 m in less than 9.589.58 seconds?

**Note:** The final time displayed by the Olympics clock is showing after rounding the original time to 22 places of decimal and is the only measure of runners performance.

### Input:

- First line will contain TT, number of testcases. Then the testcases follow.
- Each testcase contains of a single line of input, four integers k1,k2,k3,vk1,k2,k3,v.

### Output:

Output in a single line, the answer, which should be “YES” if it’s possible for Chef to create a new world record and “NO” if not.

You may print each character of the string in uppercase or lowercase (for example, the strings “yEs”, “yes”, “Yes” and “YES” will all be treated as identical).

### Constraints

- 1≤T≤1051≤T≤105
- 0<k1,k2<20<k1,k2<2
- 0<k3≤10<k3≤1
- 9<v<119<v<11
- k1,k2,k3k1,k2,k3 contain 11 digit after decimal.
- vv contains 22 digits after decimal.

### Subtasks

**Subtask #1 (100 points):** original constraints

### Sample Input:

```
3
1.0 1.0 1.0 10.45
1.0 1.0 1.0 10.44
1.0 1.0 0.9 10.44
```

### Sample Output:

```
YES
NO
NO
```

### Explanation:

**TestCase 1:** Final speed of Chef after considering all the factors will be 1∗1∗1∗10.45=10.451∗1∗1∗10.45=10.45 m / sec. So the time taken to complete the race will be 100/10.45=9.569=9.57100/10.45=9.569=9.57 sec after rounding to 22 places after decimal. Since the time is strictly less than the world record time, therefore Chef can break the record.

**TestCase 2:** Final speed of Chef after considering all the factors will be 1∗1∗1∗10.44=10.441∗1∗1∗10.44=10.44 m / sec. So the time taken to complete the race will be 100/10.44=9.578=9.58100/10.44=9.578=9.58 sec after rounding to 22 places after decimal. Since the time is equal to the world record time, therefore Chef can’t break the record.

**TestCase 3:** Final speed of Chef after considering all the factors will be 1∗1∗0.9∗10.44=9.3961∗1∗0.9∗10.44=9.396 m / sec. So the time taken to complete the race will be 100/9.396=10.643=10.64100/9.396=10.643=10.64 sec after rounding to 22 places after decimal. Since the time is strictly more than the world record time, therefore Chef can’t break the record.

```
#include <iostream>
#include <string>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
float val = 9.58;
cin >> t;
for (int i = 0; i < t; i++)
{
float v1, v2, v3, velo;
cin >> v1 >> v2 >> v3 >> velo;
float p;
r = 100 / (v1 * v2 * v3 * velo);
p = (int)(r * 100 + .5);
p = p / 100;
if (val > p)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
}
```

See more posts **here**