A. Vus the Cossack and a Contest

传送门

A. Vus the Cossack and a Contest

time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard output

题目描述
Vus the Cossack holds a programming competition, in which nn people participate. He decided to award them all with pens and notebooks. It is known that Vus has exactly mm pens and kk notebooks.
Determine whether the Cossack can reward all participants, giving each of them at least one pen and at least one notebook.

输入描述
Input
The first line contains three integers nn, mm, and kk (1≤n,m,k≤1001≤n,m,k≤100) — the number of participants, the number of pens, and the number of notebooks respectively.

输出描述
Output
Print “Yes” if it possible to reward all the participants. Otherwise, print “No”.
You can print each letter in any case (upper or lower).

样例
Examples
Input
5 8 6
output
Yes

input
3 9 3
output
Yes

input
8 5 20
output
No

Note
In the first example, there are 55 participants. The Cossack has 88 pens and 66 notebooks. Therefore, he has enough pens and notebooks.
In the second example, there are 33 participants. The Cossack has 99 pens and 33 notebooks. He has more than enough pens but only the minimum needed number of notebooks.
In the third example, there are 88 participants but only 55 pens. Since the Cossack does not have enough pens, the answer is “No”.

题意：有a个人，b只钢笔，c本笔记本，判断是否每个人都可以拿到钢笔与笔记本。

思路：只需比较a与b,c的大小关系即可。

#include<stdio.h>
int main()
{

    int a,b,c;
    while(~scanf("%d%d%d",&a,&b,&c)){
        if(a<=b&&a<=c)
            printf("YES\n");
        else printf("NO\n");
    }return 0;
}