-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPARTY2.py
37 lines (33 loc) · 1011 Bytes
/
PARTY2.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
'''Chef wants to give a burger party to all his
�
N friends i.e. he wants to buy one burger for each of his friends.
The cost of each burger is
�
X rupees while Chef has a total of
�
K rupees.
Determine whether he has enough money to buy a burger for each of his friends or not.
Input Format
The first line contains a single integer
�
T - the number of test cases. Then the test cases follow.
The first and only line of each test case contains the three integers
�
N,
�
X, and
�
K - the number of Chef's friends, the cost of each burger, and the total money Chef has, respectively.
Output Format
For each test case, output YES if the Chef can give a party to all his
�
N friends. Otherwise, output NO.
You may print each character of YES and NO in uppercase or lowercase (for example, yes, yEs, Yes will be considered identical).'''
t = int(input())
for i in range(0,t):
n,x,k = map(int,input().split())
z = n*x
if z<=k:
print("YES")
else:
print("NO")