Problem: Vus the [Cossack](https://en.wikipedia.org/wiki/Cossacks) 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 n, m, and k (1 ≤ 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 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".

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;

import javax.swing.plaf.synth.SynthOptionPaneUI;

import java.util.Collections; 



 
public class george
{
	static class Reader
    {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;
 
        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
 
        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }
 
        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1)
            {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }
 
        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do
            {
                ret = ret * 10 + c - '0';
            }  while ((c = read()) >= '0' && c <= '9');
 
            if (neg)
                return -ret;
            return ret;
        }
 
        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }
 
        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
 
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
 
            if (c == '.')
            {
                while ((c = read()) >= '0' && c <= '9')
                {
                    ret += (c - '0') / (div *= 10);
                }
            }
 
            if (neg)
                return -ret;
            return ret;
        }
 
        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }
 
        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }
 
        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }
    }
 static int max(int a[],int n) {
	 int max=a[0];
	 int ind=0;
	 for(int i=1;i<n;i++) {
		 if(a[i]>=max) {
			 max=a[i];
			 ind=i;
		 }
	 }
	 return ind;
 }
 static int min(int a[],int n) {
	 int min=a[0];
	 int ind=0;
	 for(int i=1;i<n;i++) {
		 if(a[i]<min) {
			 min=a[i];
			 ind=i;
		 }
	 }
	 return ind;
 }
 static boolean fun(int i) {
	 for(int j=3;j<=20;j++) {
		 if(i%j!=0) {
			 return false;
		 }
	 }
	 return true;
 }
 static int bin(int arr[], int l, int r, int x)
 {
     if (r>=l)
     {
         int mid = l + (r - l)/2;

       
         if (arr[mid] == x)
            return mid;

       
         if (arr[mid] > x)
            return bin(arr, l, mid-1, x);
         return bin(arr, mid+1, r, x);
     }


     return -1;
 }
 static boolean isPalindrome(int n)
 {   
     
     int divisor = 1;
     while (n / divisor >= 10)
         divisor *= 10;
   
     while (n != 0)
     {
         int leading = n / divisor; 
         int trailing = n % 10;
   
         if (leading != trailing)  
             return false;
   
         n = (n % divisor) / 10;
   
         divisor = divisor / 100;
     }
     return true;
 }
 public static String sortString(String inputString) 
 { 
     // convert input string to char array 
     char tempArray[] = inputString.toCharArray(); 
       
     // sort tempArray 
     Arrays.sort(tempArray); 
       
     // return new sorted string 
     return new String(tempArray); 
 } 
 public static boolean allDifferent( int[]a){
	    for(int i = 0; i < a.length; i++){
	        if(a[i] != 0){
	            return true;
	        }
	         
	    }
	    return false;
}

    public static void main(String[] args) throws IOException
    {
        Reader s=new Reader();
		int  a=s.nextInt();
		int  b=s.nextInt();
		int  c=s.nextInt();
		if(a>b|| a>c) {
			System.out.println("No");
		} else {
			System.out.println("Yes");
		}
    }
   
}