CF1594F.Ideal Farm

Theofanis decided to visit his uncle's farm. There are $s$ animals and $n$ animal pens on the farm. For utility purpose, animal pens are constructed in one row.

Uncle told Theofanis that a farm is lucky if you can distribute all animals in all pens in such a way that there are no empty pens and there is at least one continuous segment of pens that has exactly $k$ animals in total.

Moreover, a farm is ideal if it's lucky for any distribution without empty pens.

Neither Theofanis nor his uncle knows if their farm is ideal or not. Can you help them to figure it out?

西奥法尼斯决定去拜访他叔叔的农场。农场里共有 $s$ 只动物和 $n$ 个畜栏。出于实用目的，这些畜栏被建造成一排。

叔叔告诉西奥法尼斯：若能将所有动物分配到全部畜栏中，使得没有空畜栏，且存在至少一个连续的畜栏段，其内动物总数恰好为 $k$，则该农场被称为“幸运的”。

此外，若对于所有不产生空畜栏的分配方式，该农场都是幸运的，则称该农场是“理想的”。

西奥法尼斯和他的叔叔都不知道他们的农场是否理想。你能帮他们判断吗？

The first line contains a single integer $t$ ($1 \le t \le 10^5$) — the number of test cases.

The first and only line of each test case contains three integers $s$, $n$, and $k$ ($1 \le s, n, k \le 10^{18}$; $n \le s$).

第一行包含一个整数 $t$（$1 \le t \le 10^5$）—— 表示测试用例的数量。

每个测试用例仅有一行，包含三个整数 $s$、$n$ 和 $k$（$1 \le s, n, k \le 10^{18}$；且 $n \le s$）。

For each test case, print YES (case-insensitive), if the farm is ideal, or NO (case-insensitive) otherwise.

对于每个测试用例，如果农场是理想的，则输出 YES（不区分大小写）；否则输出 NO（不区分大小写）。

For the first and the second test case, the only possible combination is $[1]$ so there always will be a subsegment with $1$ animal but not with $2$ animals.

对于第一个和第二个测试用例，唯一可能的组合是 $[1]$，因此总是存在一个包含 $1$ 只动物的子段，但不存在包含 $2$ 只动物的子段。