8960: Assertion

内存限制:512 MB 时间限制:1 S
题面:传统 评测方式:文本比较 上传者:
提交:23 通过:13

题目描述

Alice boldly asserts to you that if you divide m items into n groups, there will definitely be one group with a quantity of items greater than or equal to d.

Due to Alice's excessive self-confidence, she is unaware that some of her assertions are actually incorrect. Your task is to determine whether Alice's assertion is correct. If Alice's assertion is true, output 'Yes'; otherwise, output 'No'.

输入格式

The input consists of multiple test cases. The first line contains a single integer �(1≤�≤105)T(1T105) — the number of test cases. Description of the test cases follows.

The first line of each test case contains three integers �,�,�n,m,d (2≤�≤109,1≤�<�,0≤�≤109)(2m109,1n<m,0d109)n and m represent the number of groups and the quantity of items, respectively, in Alice's assertion. The symbol d signifies Alice's claim that there will always be at least one group with a quantity of items greater than or equal to d.

输出格式

For each set of data, output a string. If Alice's assertion is correct, output 'Yes'; otherwise, output 'No'.

输入样例 复制

3
1 2 1
2 3 2
3 10 4

输出样例 复制

Yes
Yes
Yes

分类标签