## Algorithm

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 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.

Input

The first line contains three integers nm, and k (1n,m,k1001≤�,�,�≤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
Copy
5 8 6

output
Copy
Yes

input
Copy
3 9 3

output
Copy
Yes

input
Copy
8 5 20

output
Copy
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".

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);

int n, m, k;
cingt;gt;ngt;gt;mgt;gt;k;
(n  < = min(m, k)) ? cout<<"Yes"<<endl : cout<<"No"<<endl;

}
Copy The Code &

Input

cmd
5 8 6

Output

cmd
Yes