Class
In a class, there are n boys and m girls. The teacher wants to divide all the children into k groups while ensuring the following conditions are met:
Each group can have no more than h people.
Each group must include at least one boy.
Each group must include at least one girl.
Determine if this arrangement is possible.
Input format:
The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.Each test case is described by a single line containing four integers n, m, k, h (0 ≤ n, m ≤ 100, 0 < n + m, 1 ≤ k, h ≤ 100) — representing the number of boys, the number of girls, the number of groups required, and the maximum number of people allowed in each group.
Output format:
For each test case, print «YES» on a separate line if it is possible to distribute all the children according to the conditions, or «NO» if it is not possible.