A. Vus the Cossack and a Contest # 571 div2 A 签到水题

A. Vus the Cossack and a Contest
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
inputCopy
5 8 6
outputCopy
Yes
inputCopy
3 9 3
outputCopy
Yes
inputCopy
8 5 20
outputCopy
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”

#include<stdio.h>
int main()
{
    int a, b, c;
    scanf("%d %d %d",&a,&b,&c);
    if(b >= a && c >= a)
    {
        printf("Yes\n");
    }
    else
        printf("No\n");

    return 0;
}

.