Chef has an exam which will start exactly M minutes from now. However, instead of preparing for his exam, Chef started watching Season-1 of Superchef. Season-1 has N episodes, and the duration of each episode is K minutes. 

Will Chef be able to finish watching Season-1 strictly before the exam starts? 

\textbf{Note:} Please read the explanations of the sample test cases carefully.

------ Input Format ------ 

- The first line contains an integer T denoting the number of test cases. T test cases then follow.
- The first and only line of each test case contains 3 space separated integers M, N and K.

------ Output Format ------ 

For each test case, output on one line YES if it is possible to finish Season-1 strictly before the exam starts, or NO if it is not possible to do so. 

Output is case insensitive, which means that "yes", "Yes", "YEs", "no", "nO" - all such strings will be acceptable.

------ Constraints ------ 

$1 ≤ T ≤ 10^{4}$
$1 ≤ M ≤ 10^{9}$
$1 ≤ N, K ≤ 10^{4}$

----- Sample Input 1 ------ 
3
10 1 10
25 2 10
15 2 10
----- Sample Output 1 ------ 
NO
YES
NO
----- explanation 1 ------ 
Test Case $1$: The duration of the only episode is $10$ minutes, and the exam starts exactly after $10$ minutes. So, Chef will not be able to finish watching Season-$1$ strictly before the exam starts.

Test Case $2$: There are two episodes in Season-$1$, each of duration $10$ minutes. Therefore, Chef will require $10 + 10 = 20$ minutes to finish watching Season-$1$. As the exam starts after $25$ minutes, Chef will be able to finish watching Season-$1$ strictly before the exam starts.

Test Case $3$: There are two episodes in Season-$1$, each of duration $10$ minutes. Therefore, Chef will require $10 + 10 = 20$ minutes to finish watchin Season-$1$. As the exam starts after $15$ minutes, Chef will not be able to finish watching Season-$1$ strictly before the exam starts.

Source: codechef | Difficulty: EASY
Tags: Mathematics


Solutions:
for j in range(int(input())):
	(m, n, k) = map(int, input().split())
	if m > n * k:
		print('YES')
	else:
		print('NO')


N = int(input())
for i in range(N):
	(x, y, z) = map(int, input().split())
	if x > y * z:
		print('YES')
	else:
		print('NO')


def chef():
	(x, y, z) = map(int, input().split())
	if y * z < x:
		return 'YES'
	else:
		return 'NO'
n = int(input())
for _ in range(n):
	print(chef())


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


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


n = int(input())
for i in range(0, n):
	(x, y, z) = map(int, input().split())
	a = y * z
	if a < x:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	(M, N, K) = map(int, input().split())
	if N * K < M:
		print('YES')
	else:
		print('NO')


T = int(input())
for i in range(T):
	(m, n, k) = map(int, input().split())
	s = n * k
	if s < m:
		print('YES')
	else:
		print('NO')


T = int(input())
for i in range(T):
	(M, N, K) = map(int, input().split())
	if N * K < M:
		print('YES')
	else:
		print('NO')


def solve():
	(x1, y1, z1) = map(int, input().split())
	if y1 * z1 < x1:
		return 'YES'
	else:
		return 'NO'
n = int(input())
for _ in range(n):
	print(solve())


T = int(input())
for i in range(T):
	a = input()
	b = a.split()
	if int(b[1]) * int(b[2]) < int(b[0]):
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(m, n, k) = map(int, input().split())
	if n * k >= m:
		print('NO')
	else:
		print('YES')


T = int(input())
for i in range(T):
	(a, b, c) = map(int, input().split())
	if a - b * c > 0:
		print('YES')
	else:
		print('NO')


n = int(input())
for _ in range(n):
	(M, N, K) = list(map(int, input().split()))
	if N * K < M:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(E, S, T) = map(int, input().split())
	if S * T >= E:
		print('NO')
	else:
		print('YES')


n = int(input())
for i in range(n):
	(a, b, c) = list(map(int, input().split()))
	if b * c < a:
		print('YES')
	else:
		print('NO')


tst = int(input())
for i in range(0, tst):
	(m, n, k) = map(int, input().split())
	if n * k < m:
		print('YES')
	else:
		print('NO')


def solve():
	(x, y, z) = map(int, input().split())
	if y * z < x:
		return 'YES'
	else:
		return 'NO'
n = int(input())
for i in range(n):
	print(solve())


for _ in range(int(input())):
	(M, N, K) = map(int, input().split())
	final = int(N / 2)
	print('YES') if N * K < M else print('NO')


n = int(input())
for i in range(n):
	(l, k, m) = list(map(int, input().split()))
	if l > k * m:
		print('YES')
	else:
		print('NO')


i = int(input(''))
j = 0
while j < i:
	n1 = input('')
	n = n1.split()
	M = int(n[0])
	N = int(n[1])
	K = int(n[2])
	if M > N * K:
		op = 'YES'
	else:
		op = 'NO'
	j += 1
	print(op)