CF1186A.Vus the Cossack and a Contest

Vus the Cossack holds a programming competition, in which $n$ people participate. He decided to award them all with pens and notebooks. It is known that Vus has exactly $m$ pens and $k$ notebooks.

Determine whether the Cossack can reward all participants, giving each of them at least one pen and at least one notebook.

瓦斯这位哥萨克人举办了一场编程竞赛，共有 $n$ 人参加。他决定给所有参赛者颁发钢笔和笔记本。已知瓦斯恰好有 $m$ 支钢笔和 $k$ 本笔记本。

请判断这位哥萨克人能否给所有参赛者都颁奖，使得每人至少获得一支钢笔和一本笔记本。

The first line contains three integers $n$, $m$, and $k$ ($1 \leq n, m, k \leq 100$) — the number of participants, the number of pens, and the number of notebooks respectively.

第一行包含三个整数 $n$、$m$ 和 $k$（$1 \leq n, m, k \leq 100$），分别表示参与者的数量、钢笔的数量和笔记本的数量。

Print "Yes" if it possible to reward all the participants. Otherwise, print "No".

You can print each letter in any case (upper or lower).

如果可以奖励所有参与者，则输出“Yes”；否则输出“No”。

你可以以任意大小写（大写或小写）输出每个字母。

In the first example, there are $5$ participants. The Cossack has $8$ pens and $6$ notebooks. Therefore, he has enough pens and notebooks.

In the second example, there are $3$ participants. The Cossack has $9$ pens and $3$ notebooks. He has more than enough pens but only the minimum needed number of notebooks.

In the third example, there are $8$ participants but only $5$ pens. Since the Cossack does not have enough pens, the answer is "No".

在第一个例子中，有 $5$ 名参与者。哥萨克有 $8$ 支钢笔和 $6$ 本笔记本，因此他拥有的钢笔和笔记本数量充足。

在第二个例子中，有 $3$ 名参与者。哥萨克有 $9$ 支钢笔和 $3$ 本笔记本。他的钢笔数量绰绰有余，但笔记本数量恰好达到最低需求。

在第三个例子中，有 $8$ 名参与者，但仅有 $5$ 支钢笔。由于哥萨克的钢笔数量不足，答案为“No”。