Suppose Chef is stuck on an island and currently he has $x$ units of food supply and $y$ units of water supply in total that he could collect from the island. He needs $x_{r}$ units of food supply and $y_{r}$ units of water supply per day at the minimal to have sufficient energy to build a boat from the woods and also to live for another day. Assuming it takes exactly $D$ days to build the boat and reach the shore, tell whether Chef has the sufficient amount of supplies to be able to reach the shore by building the boat?

------ Input: ------

First line will contain $T$, number of testcases. Then the testcases follow. 
Each testcase contains of a single line of input, five integers $x, y, x_{r}, y_{r}, D$. 

------ Output: ------
For each testcase, output in a single line answer "YES" if Chef can reach the shore by building the boat and "NO" if not (without quotes).

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

------ Constraints  ------
$1 ≤ T ≤ 300$
$1 ≤ x, y ≤ 100$
$1 ≤ x_{r}, y_{r}, D ≤ 10$

----- Sample Input 1 ------ 
3
4 2 1 1 1
4 2 1 3 1
4 2 4 2 2
----- Sample Output 1 ------ 
YES
NO
NO
----- explanation 1 ------ 
TestCase 1: Chef's food supply will last for $\frac{4}{1} = 4$ days and water supply will last for $\frac{2}{1} = 2$ days, so in total he will be able to survive for $min(4, 2) = 2$ days and since required time to reach the shore is $1$ day, he will be able to reach there.

TestCase 2: Chef's food supply will last for $\frac{4}{1} = 4$ days and water supply will last for $\frac{2}{3} = 0.67$ days, so in total he will be able to survive for $min(4, 0.67) = 0.67$ days and since required time to reach the shore is $1$ day, he won't be able to reach there.

TestCase 3: Chef's food supply will last for $\frac{4}{4} = 1$ day and water supply will also last for $\frac{2}{2} = 1$ day, so in total he will be able to survive for $min(1, 1) = 1$ day and since required time to reach the shore is $2$ days, he won't be able to reach there.

Source: codechef | Difficulty: EASY
Tags: Mathematics


Solutions:
t = int(input())
for i in range(t):
	(x, y, x1, y1, d) = map(int, input().split())
	if min(x / x1, y / y1) >= d:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b, c, d, e) = map(int, input().split())
	x = a // c
	y = b // d
	z = min(x, y)
	if z >= e:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(x, y, xr, yr, d) = map(int, input().split())
	m = min(x / xr, y / yr)
	if d > m:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(t):
	(x, y, xr, yr, d) = map(int, input().split())
	min_days = min(x // xr, y // yr)
	if min_days >= d:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	(x, y, xr, yr, d) = list(map(int, input().split()))
	if xr * d <= x and yr * d <= y:
		print('YES')
	else:
		print('NO')


t = int(input())
m = 999
for i in range(0, t):
	(x, y, xr, yr, d) = [int(x) for x in input().split(' ')]
	a = x / xr
	b = y / yr
	if a < b:
		m = a
	elif b < a:
		m = b
	else:
		m = a
	if m < d:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	(x, y, rx, ry, d) = map(int, input().split(' '))
	r1 = x / rx
	r2 = y / ry
	t = min(r1, r2)
	if t >= d:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(x, y, a, b, d) = map(int, input().split())
	f = x // a
	w = y // b
	if f >= d and w >= d:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(x, y, xr, yr, D) = map(int, input().split())
	(f, w) = (x / xr, y / yr)
	if min(f, w) >= D:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	(x, y, x1, y1, D) = map(int, input().split())
	fd = x / x1
	wt = y / y1
	day = min(fd, wt)
	if day >= D:
		print('YES')
	else:
		print('NO')


T = int(input())
for _ in range(T):
	(x, y, xr, yr, D) = map(int, input().split())
	food_supply = x // xr
	water_supply = y // yr
	min_days = min(food_supply, water_supply)
	if min_days >= D:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b, c, d, e) = map(int, input().split())
	if e <= a / c and e <= b / d:
		print('YES')
	else:
		print('NO')


T = int(input())
for i in range(T):
	(x, y, xr, yr, D) = map(int, input().split())
	if xr * D <= x and yr * D <= y:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(0, t):
	(x, y, a, b, d) = map(int, input().split())
	miny = min(x / a, y / b)
	if miny >= d:
		print('YES')
	else:
		print('NO')


def code():
	cases = int(input())
	for _ in range(cases):
		(x, y, xr, yr, D) = map(int, input().split(' '))
		food_days = x // xr
		water_days = y // yr
		if min(food_days, water_days) >= D:
			print('YES')
		else:
			print('NO')
code()


for i in range(int(input())):
	(x, y, n, m, z) = map(int, input().split())
	a = x // n
	b = y // m
	c = min(a, b)
	if c < z:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(t):
	(a, b, x, y, p) = map(int, input().split())
	if min(a / x, b / y) >= p:
		print('YES')
	else:
		print('NO')


import sys
t = int(input())
while t != 0:
	(a, b, c, d, e) = map(int, sys.stdin.readline().split())
	f = a // c
	g = b // d
	h = min(f, g)
	if h >= e:
		print('YES')
		t -= 1
	else:
		print('NO')
		t -= 1


n = int(input())
for i in range(n):
	(a, b, c, d, e) = map(int, input().split())
	p = a / c
	q = b / d
	r = min(p, q)
	if r >= e:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b, x, y, d) = map(int, input().split())
	p = a / x
	q = b / y
	D = min(p, q)
	if D >= d:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(x1, x2, x3, x4, d) = map(int, input().split())
	h = x1 / x3
	j = x2 / x4
	o = min(h, j)
	if o >= d:
		print('YES')
	else:
		print('NO')


for j in range(int(input())):
	(x, y, x1, y1, d) = map(int, input().split())
	p = min(x // x1, y // y1)
	if p >= d:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b, x, y, d) = list(map(float, input().split()))
	c = a / x
	s = b / y
	z = min(c, s)
	if z >= d:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	(x, y, xr, yr, D) = list(map(int, input().split()))
	food = x / xr
	water = y / yr
	survival = min(food, water)
	if survival >= D:
		print('YES')
	else:
		print('NO')


class kishore:

	def first(self, t):
		for i in range(t):
			(x, y, x1, y1, d) = map(int, input().split())
			res1 = x / x1
			res2 = y / y1
			k = min(res1, res2)
			if k >= d:
				print('YES')
			else:
				print('NO')
			pass
t = int(input())
o = kishore()
o.first(t)


for _ in range(int(input())):
	li = list(map(int, input().split()))
	food = li[0] / li[2]
	water = li[1] / li[3]
	if min(food, water) >= li[-1]:
		print('YES')
	else:
		print('NO')


testcases = int(input())
for _ in range(testcases):
	(x, y, a, b, d) = map(int, input().split())
	if d * a <= x and d * b <= y:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	(x, y, x1, y1, d) = list(map(int, input().split()))
	p = x / x1
	q = y / y1
	l = min(p, q)
	if l >= d:
		print('YES')
	else:
		print('NO')