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



Sample input:
1 3 2


Sample output:
Yes

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i=list(map(int,input().split(" ")));

a=i[0];
b=i[1];
c=i[2];

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

Submission status: Accepted

Solution code:
a,b,c = (int(i) for i in input().split())
if(a<=c and c<=b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
#a = int(input())
#ls = list(input().split(" "))
#ls = list(map(int,input().split(" ")))
a,b,c = list(map(int,input().split(" ")))
#string = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())
    print('YNeos'[not A <= C <= B::2])


main()

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b, c = LI()
    if a <= c <= b:
        print("Yes")
        return
    print("No")
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
from collections import defaultdict

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC61 A

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())
if c >= a and c <= b:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 整数C++がA以上B以下であるか判定

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if a[0] <= a[2] <= a[1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A問題
a, b, c = map(int, input().split())
if a <= c and c <= b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(s) for s in input().split()]
print('Yes' if A <= C <= B else 'No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(A: int, B: int, C: int):
    ret = NO
    if A <= C <= B:
        ret = YES
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

# 両方とも正しいならば YES、そうでないならば NO を出力してください。

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

# print(A)
# print(B)
# print(C)

# 条件を満たす場合はYes、そうでない場合はNoを出力せよ。
if C >= A and C <= B:
 print('Yes')
else:
 print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = list(map(int,input().split(' ')))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split(" ")]
if a[0] <= a[2] <= a[1]:
  	print("Yes")
else:
  	print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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


abc()

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc061/tasks/abc061_a

import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
print('Yes') if A <= C <= B else print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###template###
import sys
input = sys.stdin.readline
def mi(): return map(int, input().split())
###template###

A, B, C = mi()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c =[int(v) for v in input().split()]
if a <= c <= b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力
# スペース区切りの整数の入力(定数)
a, b, c = map(int, input().split())

# 計算と出力
if (c >= a) and (c <= b) :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# vim: set fileencoding=utf-8:
import sys
input = sys.stdin.readline

A, B, C = [int(ele) for ele in input().split()]


def main():
    ans = "No"
    if A <= C <= B:
        ans = "Yes"

    print(ans)


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
        if i != n // i:
            divisors.append(n//i)
    return divisors


class Node():

    def __init__(self):
        self.idx = None
        self.left = None
        self.right = None
        self.parent = None
        return

    def pre_order(self):
        global pre_order_str
        pre_order_str += str(self.idx) + " "
        if self.left:
            self.left.pre_order()

        if self.right:
            self.right.pre_order()

    def in_order(self):
        global in_order_str

        if self.left:
            self.left.in_order()

        in_order_str += str(self.idx) + " "

        if self.right:
            self.right.in_order()

    def post_order(self):
        global post_order_str
        if self.left:
            self.left.post_order()

        if self.right:
            self.right.post_order()

        post_order_str += str(self.idx) + " "


class HeapHelper():
    """HeapContrler.
    完全二分木を二分ヒープで表現した配列 A に対して、
    HeapHelper.parent(idx) とするとそのノードの親の添字を返す
    存在しない場合は Falseを返す

    Returns:
        [type] -- [description]
    """

    def __init__(self):
        return

    @staticmethod
    def parent(i):
        if i == 1:
            return False

        return int(i/2)

    @staticmethod
    def left(i):
        l_idx = 2*i
        if H < l_idx:
            return False

        return l_idx

    @staticmethod
    def right(i):
        r_idx = 2*i + 1
        if H < r_idx:
            return False

        return r_idx


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
print("YNeos"[1-(A<=C<=B)::2])

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math

mod = 10**9+7

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

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

Submission status: Accepted

Solution code:
#N = int(input())
#A = [int(x) for x in input().split()]
#a, b, c = map(int, input().split())
#name1 = str(input())
#alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}
a, b, c = map(int, input().split())
if a <= c <= b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().rstrip().split(' '))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c =[int(i) for i in input().split()]
if a <= c <= b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(" YNeos"[a<=c<=b::2])

Submission status: Accepted

Solution code:
print("YNeos"[not(lambda x,y,z:x<=z<=y)(*map(int,input().split()))::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

def read_input():
    a, b, c = map(int, input().split())
    return a, b, c

def submit():
    a, b, c = read_input()

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


if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if A <= C <= B:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(["No", "Yes"] [A <= C and B >= C])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(n) for n in input().split()]

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

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

solve()

Submission status: Accepted

Solution code:
import functools

import os
import sys

sys.setrecursionlimit(10000)
INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


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


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def Yesif(cond):
    print('Yes' if cond else 'No')


def YESIF(cond):
    print('YES' if cond else 'NO')


def yesif(cond):
    print('yes' if cond else 'no')


a, b, c = inl()
Yesif(a <= c <= b)

Submission status: Accepted

Solution code:
import functools

import os
import sys

sys.setrecursionlimit(10000)
INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


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


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        ret = fn(*args, **kwargs)
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        print(ret)
        return ret

    return wrapper



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

Submission status: Accepted

Solution code:
# ABC061A - Between Two Integers
a, b, c = list(map(int, input().rstrip().split()))
print("Yes" if a <= c <= b else "No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(item) for item in input().split()]
if c >= a and c <= b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    a, b, c = (int(_) for _ in input().split())
    if c >= a and c <= b:
        print('Yes')
    else:
        print('No')
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split());print('YNeos'[1-(A<=C<=B)::2])

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    A = list(map(int, input().split()))

    if A[0] <= A[2] <= A[1]:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

Solution code:
a, c, b = map(int, input().split());print("YNeos"[not (a<=b<=c)::2])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
a,b,c = LI()
if a <= c <= b:
    print("Yes")
else:
    print("No")
#B

#C

#D
"""
def bellman_ford(start):
    dist = [float("inf") for i in range(n)]
    dist[start] = 0
    for i in range(n-1):
        update = False
        for j, k, l in adj:
                if dist[k] > dist[j] + l:
                    dist[k] = dist[j] + l
                    update = True
        if not update:
            break
    negative = [False for i in range(n)]
    for j, k, l in adj:
        if dist[k] > dist[j] + l:
            dist[k] = dist[j] + l
            negative[k] = True
    return dist,negative[n-1]
n,m = LI()
adj = []
for i in range(m):
    a,b,c = LI()
    a -= 1
    b -= 1
    adj.append([a,b,-c])
d,ne = bellman_ford(0)
if ne:
    print("inf")
else:
    print(-d[-1])
"""

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split(' '))
if x<=z and y>=z:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def between_two_integers(A: int, B: int, C: int)->bool:
    return A <= C and C <= B


if __name__ == "__main__":
    A, B, C = map(int, input().split())
    yes = between_two_integers(A, B, C)
    print('Yes' if yes else 'No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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