Problem:
 Score : 100 points    Problem Statement You are given three integers A , B and C .
Determine whether C is not less than A and not greater than B .      Constraints  -100≤A,B,C≤100   A , B and C are all integers.         Input Input is given from Standard Input in the following format:  A  B  C       Output If the condition is satisfied, print Yes ; otherwise, print No .        Sample Input 1 1 3 2      Sample Output 1 Yes  C=2 is not less than A=1 and not greater than B=3 , and thus the output should be Yes .       Sample Input 2 6 5 4      Sample Output 2 No  C=4 is less than A=6 , and thus the output should be No .       Sample Input 3 2 2 2      Sample Output 3 Yes

Solution (Python):
a, b, c = map(int, input().split())

if a <= c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int, input().split())
if a<=c<=b:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split())
print("Yes" if a<=c<=b else "No")

Solution (Python):
a,b,c=map(int,input().split())
print('NYoe s'[a<=c<=b::2])

Solution (Python):
A,B,C = map(int,input().split())

print("Yes" if A <= C and C <=B else "No")

Solution (Python):
a,b,c = map(int,input().split())
if c >= a and c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    A, B, C = map(int, input().split())

    print('Yes') if A <= C <= B else print('No')

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    if a <= c <= b:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
A,B,C= map(int,input().split())

if A<=C<=B:
	print('Yes')
else:
  	print('No')

Solution (Python):
a , b , c = map(int,input().split())
if a <= c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
A, B, C = map(int, input().split())

if (C >= A) and (C <= B):
    print("Yes")

else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
print("Yes") if a<=c and c<=b else print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a <= c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = input().split()
a = int(a)
b = int(b)
c = int(c)

if a <= c and c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):


a, b, c = map(int, input().split())

if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):

url = "https://atcoder.jp//contests/abc061/tasks/abc061_a"

def main():
    t = list(map(int, input().split()))
    print('Yes') if t[0] <= t[2] and t[1] >= t[2] else print('No')

if __name__ == '__main__':
    main()

Solution (Python):
def actual(A, B, C):
    if A <= C <= B:
        return 'Yes'

    return 'No'

A, B, C = map(int, input().split())
print(actual(A, B, C))

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    if C >= A and C <= B:
        print('Yes')
    else:
        print('No')
main()

Solution (Python):
import sys
A,B,C = map(int,input().split())

if A < -100 or A > 100 or B < -100 or B > 100 or C < -100 or C > 100:
    sys.exit()

if C >= A and C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())
print("Yes" if A <= C <= B else "No")

Solution (Python):
A,B,C = map(int, input().split())

if C >= A and C <= B:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
ans = 'No'

if(a <= c <= b):
    ans = 'Yes'

print(ans)

Solution (Python):
a,b,c=map(int,input().split());print("Yes" if c>=a and c<=b else "No")

Solution (Python):
A,B,C = map(int,input().split())

if A<=C<=B:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split());print(['No','Yes'][a<=c<=b])

Solution (Python):
a,b,c=map(int,input().split());print(' YNeos'[a<=c<=b::2].strip())

Solution (Python):
A,B,C=[int(i) for i in input().split()]
print("Yes" if (A<=C and C<=B) else "No")

Solution (Python):
a, b, c = map(int, input().split())
print('Yes' if a <= c <= b else 'No')

Solution (Python):
num = input('').split()

num = [int(x) for x in num] 

ans = 'Yes' if num[0] <= num[2] <= num[1] else 'No'

print(ans)

Solution (Python):
A, B, C = map(int, input().split())
if A<= C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    A, B, C = map(int, input().split())
    if A <= C <= B:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    resolve()

Solution (Python):
a, b, c = map(int, input().split())

if c <= b and c >= a:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int,input().split())
if a<=c<=b:
	print("Yes")
else:
	print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a<=c<=b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
print("Yes" if c >= a and c <= b else "No")

Solution (Python):
A,B,C=map(int,input().split())
if A<=C and C<=B:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if C >= A and C <= B :
  print("Yes")
else :
  print("No")

Solution (Python):
A,B,C=map(int,input().split())
if A<=C<=B:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())

if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C = map(int,input().split())

print('Yes' if A <= C <= B else 'No')

Solution (Python):
a,b,c = map(int,input().split())
if a <= c and c <= b: print('Yes')
else: print('No')

Solution (Python):
a,b,c=map(int,input().split())
print("Yes"if a<=c<=b else"No")

Solution (Python):
A,B,C=map(int,input().split())

if A<=C<=B:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = map(int, input().split())
print("Yes" if a<=c<=b else "No")

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())

if c >= a and c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split());print('NYoe s'[a<=c<=b::2])

Solution (Python):
a, b, c=map(int, input().split())
print("Yes" if a <= c <= b else "No")

Solution (Python):
def resolve():
    a, b, c = map(int, input().split())
    ans = str()

    if c >= a and c <= b:
        ans = "Yes"
    else:
        ans = "No"
    
    print(ans)
resolve()

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C = map(int, input().split())

if A<= C<= B:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int, input().split())
print('Yes' if c >= a and c <= b else 'No')

Solution (Python):
A, B, C = map(int, input().split())

print("Yes" if A<=C<=B else "No")

Solution (Python):
A,B,C = map(int,input().split())
if(A<= C <= B):
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int, input().split())

if a <= c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
A,B,C=map(int,input().split())

if A<=C and C<=B:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int,input().split())

if A<=C and B>=C:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a<=c and c<=b:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int, input().split())
if A <= C <= B:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int,input().split())
if a <= c and b >= c:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = list(map(int, input().split()))

if C >= A and C <= B:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a<=c and c<=b:
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = map(int, input().split())
print("Yes" if C >= A and C <= B else "No")

Solution (Python):
a,b,c = list(map(int,input().strip().split()))

if c >= a and c <=b:
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = map(int, input().split())

if (C>=A) and (C<=B):
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a<=c<=b:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int,input().split())

if A<=C<=B:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = list(map(int, input().split()))
if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a <= c and c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int, input().split())
print("Yes" if a<=c<=b else "No")

Solution (Python):
a,b,c=map(int,input().split())
print("Yes" if c>=a and c<=b else "No")

Solution (Python):
a,b,c=map(int,input().split())
if c>=a and c<=b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int,input().split())
print("Yes" if a <= c <= b else "No")

Solution (Python):
a,b,c=map(int,input().split())

if a<=c and b>=c:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, (input().split()))
s="No"
if a <= c and c <= b:
    s="Yes"
print(s)

Solution (Python):
a,b,c=map(int,input().split())

if a<=c and b>=c:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
if c >= a and c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
if (a <= c <= b):
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if c>=a and c<=b:
    print("Yes")
else:
    print("No")

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c = mi()
    print('Yes') if a <= c <= b else print('No')


if __name__ == "__main__":
    main()

Solution (Python):
a,b,c = map(int, input().split())
print(['No', 'Yes'][a<=c and c<=b])

Solution (Python):

a,b,c,=map(int,input().split())

if (a<=c<=b):print('Yes')
else:print('No')

Solution (Python):



a, b, c = map(int, input().split())

if a <= c <= b:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a <= c and c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=input().split()

a=int(a)
b=int(b)
c=int(c)

if(a<=c and b>=c):
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
import bisect
import heapq

sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline

def main():
    a,b,c = map(int,read().split())
    if a <= c and c <= b:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())
    print("Yes" if A <= C <= B else "No")
   
    
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
a,b,c = map(int,input().split())
print('Yes' if c >= a and c <= b else 'No')

Solution (Python):
A, B, C = map(int, input().split())
if A<=C and B>= C:
  print('Yes')
else:
  print('No')

Solution (Python):
A, B, C = map(int, input().split())

if A <= C <= B:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())

if a <= c and c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int, input().split())
if a <= c and c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int, input().split())
print("Yes" if a <= c <= b else "No")

Solution (Python):
import sys
input = sys.stdin.readline

a, b, c = [int(x) for x in input().split()]

ans = "Yes" if a <= c <= b else "No"

print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
from collections import *

A, B, C = map(int, input().split())

if A<=C<=B:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int,input().split())
if A<=C<=B:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
print('Yes' if a<=c<=b else 'No')

Solution (Python):
a,b,c=map(int,input().split())
if c>=a and c<=b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split())
print('Yes' if a<=c<=b else 'No')

Solution (Python):
A,B,C = map(int,input().split())
if A <= C and C <= B:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())

if A <= C <= B :
    print("Yes")
else :
    print("No")

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
if c >= a and c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())

print('Yes') if a <= c <= b else print('No')

Solution (Python):
A,B,C = map(int,input().split())
if A<=C and C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
print('YNeos'[c<a or c>b::2])

Solution (Python):
a,b,c=map(int,input().split())
if a<=c<=b:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a<=c<=b:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
print('Yes' if A <= C <= B else 'No')

Solution (Python):
A,B,C=map(int,input().split());print(['No','Yes'][A<=C<=B])

Solution (Python):
A,B,C=map(int,input().split());print(['Yes','No'][C<A or C>B])

Solution (Python):
A,B,C = map(int,input().split())
print('Yes' if A <= C <= B else 'No')

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print("Yes")
    raise SystemExit(0)
print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a <= c and c <= b:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = list(map(int, input().split()))
print("Yes" if a <= c <= b else "No")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b, c = map(int, readline().split())
ans = 'Yes' if a <= c <= b else 'No'
print(ans)

Solution (Python):
x, y, z = map(int, input().split())
if x <= z <= y:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = list(map(int, input().split()))
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
print("Yes" if A <= C <= B else "No")

Solution (Python):
def main():
  num = list(map(int,input().split()))
  if(num[0]<=num[2] and num[2]<=num[1]):
    print('Yes')
  else:
    print('No')

main()

Solution (Python):
A,B,C=map(int,input().split())
if C>=A and C<=B :
    print('Yes')
else :
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
print('Yes' if A <= C and C<= B else 'No')

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    A,B,C=map(int,input().split())
    YesNo(A<=C<=B)

if __name__ == '__main__':
    main()

Solution (Python):


a, b, c = map(int, input().split())
print('Yes' if a <= c <= b else 'No')

Solution (Python):
a, b, c = map(int, input().split())

if a <= c and c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int, input().split())

if c >=a and c <=b :
    print("Yes")

else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C = map(int, input().split())
if A <= C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())
if A <= C <= B:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if c>=a and c<=b:
  print('Yes')
else:print('No')

Solution (Python):
A,B,C = map(int, input().split())
if (A<=C)&(C<=B):
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())
print('Yes' if A <= C <= B else 'No')

Solution (Python):
A,B,C = map (int,input().split())
if A<=C<=B:
    print('Yes')
else:
    print('No')

Solution (Python):



a, b, c = map(int, input().split()) 

if a <= c <= b:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int,input().split())
print('Yes' if a <= c <= b else 'No')

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,c = LI()
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
if A <= C and C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())
if A <= C <= B:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = map(int,input().split())
if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())

if A<=C<=B:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if(c>=a and c<=b):
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right


from functools import reduce
from pprint import pprint

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

def MI():
    return map(int,input().split())

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]

a,b,c = RI()

if c>=a and c<=b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int, input().split())
print("Yes" if a<=c<=b else "No")

Solution (Python):
from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,b,c = mi()
if a <= c and c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
from collections import Counter
from collections import deque
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

a,b,c=mp()
if a<=c<=b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = tuple(map(int,input().split()))

if c>=a and c<=b:
  print("Yes")
else:
  print("No")

Solution (Python):
A,B,C = map(int,input().split())

print("Yes" if A <= C <= B else "No")

Solution (Python):
A, B, C = map(int, input().split())
if A <= C <= B:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int,input().split())
print ("Yes") if a <= c and c <= b else print ("No")

Solution (Python):
a,b,c = map(int, input().split())
if c <= b and c >= a:
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C = map(int, input().split())
print('Yes' if A <= C <= B else 'No')

Solution (Python):
a, b, c = map(int, input().split())
if a <= c and c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
print("Yes" if a <= c <= b else "No")

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())

print('Yes' if A <= C <= B else 'No')

Solution (Python):
A,B,C=map(int,input().split())
if (A<=C<=B):
    print("Yes")
else:
    print("No")

Solution (Python):

"""
Created on Thu May 14 15:55:07 2020

@author: shinba
"""

a,b,c = map(int,input().split())

if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())

if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a<=c<=b:
  print("Yes")
else:
  print("No")

Solution (Python):
A,B,C = map(int,input().split())

if A <= C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
print("Yes"if a<=c<=b else"No")

Solution (Python):
a, b, c = map(int, input().split())

if a <= c and c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if c>=a and c<=b:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):

A, B, C = map(int, input().split())

print(['No', 'Yes'][A <= C <= B])

Solution (Python):
a, b, c = map(int, input().split())
print(("Yes" if a <= c <= b else "No"))

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B,C = inputIL()

if A<=C<=B:
  print("Yes")
  
else:
  print("No")

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    if a <= c and c <= b:
        ans = 'Yes'
    else:
        ans = 'No'
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a, b, c = map(int, input().split())

if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
import math
import bisect

def main():
    a, b, c = map(int, input().split())
    if c >= a and c <= b:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Solution (Python):
A,B,C = map(int,input().split())

if C >= A and C <= B:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if c < a or b < c:
  print('No')
else:
  print('Yes')

Solution (Python):
A, B, C = map(int, input().split())
print("Yes" if A <= C <= B else "No")

Solution (Python):
A,B,C = map(int, input().split())



if C >= A and C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())
print("Yes" if A <= C <= B else "No")

Solution (Python):
A, B, C = map(int,input().split())
if A <= C and C <= B:
	  print("Yes")
else:
    print("No")

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7

A, B, C = ri_()
print('Yes' if A <= C <= B else 'No')

Solution (Python):
A,B,C=map(int,input().split())
print('Yes' if (A<=C and C<=B) else 'No')

Solution (Python):
A, B, C = map(int, input().split())
if A <= C <= B:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a <= c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int, input().split())
print('Yes' if A <= C <= B else 'No')

Solution (Python):

def ABC_61_A():
    A,B,C = map(int, input().split())
    
    if C>=A and C<=B:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':

    ABC_61_A()

Solution (Python):
a, b, c= map(int,input().split())

if c >= a and c<= b:
    print('Yes')
else: 
    print('No')

Solution (Python):
A, B, C = list(map(int,input().split()))
if A <= C <= B:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a<=c<=b:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())

if c>=a and c<=b:
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    a,b,c = (int(x) for x in input().split())
    print('Yes' if a <= c <= b else 'No')

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c=map(int,input().split())
print("Yes" if a<=c<=b else "No")

Solution (Python):
A, B, C = map(int, input().split())

if C >= A and C <= B:
  print('Yes')
else:
  print('No')

Solution (Python):
A, B, C = list(map(int,input().split()))
print('Yes' if A <= C <= B else 'No')

Solution (Python):
A, B, C = map(int, input().split())
print(['No', 'Yes'][A <= C <= B])

Solution (Python):
A,B,C=map(int,input().split())
if A<=C and C<=B:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int,input().split())
print('Yes' if c>=a and b>=c else "No")

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a<=c<=b:
  print("Yes")
else:
  print("No")

Solution (Python):

A, B, C = map(int, input().split())

print("Yes" if C >= A and C <= B else "No")

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

a,b,c = map(int,input().split())
if a <= c and c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A, B, C = MAP()
print("Yes" if A <= C <= B else "No")

Solution (Python):
A, B, C = map(int, input().split())

if C >= A and C <= B:
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c = map(int, input().split())
print(['No', 'Yes'][c>=a and c<=b])

Solution (Python):
a, b, c = map(int, input().split())
print("Yes" if a <= c <= b else "No")

Solution (Python):
A,B,C = map(int,input().split())
if C>=A and C<=B: 
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int,input().split())

if a<=c<=b:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=map(int,input().split())
print("Yes" if b>=c>=a else "No")

Solution (Python):


a, b, c = map(int, input().split())

if c >= a and c <= b:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C = map(int,input().split())

print('Yes' if A <= C <= B else 'No')

Solution (Python):
a, b, c = map(int, input().split())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Solution (Python):
x = input().split()
A, B, C = int(x[0]), int(x[1]), int(x[2])
if (C >= A) and (C <= B):
  print('Yes')
else:
  print('No')