You have r red and b blue beans. You'd prefer to convey them among a few (possibly, one) parcels so that every bundle: has somewhere around one red bean (or the number of red beans ri≥1); has something like one blue bean (or the number of blue beans bi≥1); the number of red and blue beans ought to vary in close to d (or |ri−bi|≤d) Would you be able to convey all beans? Input The main line contains the single integer t (1≤t≤1000) — the number of experiments. The solitary line of each experiment contains three integers r, b, and d (1≤r,b≤109; 0≤d≤109) — the number of red and blue beans and the most extreme outright distinction in every parcel.
Correct answer will be upvoted else downvoted.
You have r red and b blue beans. You'd prefer to convey them among a few (possibly, one) parcels so that every bundle:
has somewhere around one red bean (or the number of red beans ri≥1);
has something like one blue bean (or the number of blue beans bi≥1);
the number of red and blue beans ought to vary in close to d (or |ri−bi|≤d)
Would you be able to convey all beans?
Input
The main line contains the single integer t (1≤t≤1000) — the number of experiments.
The solitary line of each experiment contains three integers r, b, and d (1≤r,b≤109; 0≤d≤109) — the number of red and blue beans and the most extreme outright distinction in every parcel.
Output
For each experiment, on the off chance that you can disperse all beans, print YES. In any case, print NO.
You might print each letter regardless you need (in this way, for instance, the strings yEs, indeed, Yes and YES are completely perceived as certain reply).
Step by step
Solved in 3 steps with 1 images
