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())
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:
def INT():
    return int(input())

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

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

A, B, C = MI()
print("Yes" if A <= C <= B else "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())
print("Yes" if c >= a 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())
if a <= c <= b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
l = input().split(' ')

l = list(map(int, l))

if l[2] >= l[0] and l[2] <= l[1]:
    print ('Yes')
else:
    print ('No')

Submission status: Accepted

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

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

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:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b, c = M()
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 = 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(['No','Yes'][c >= a and c<=b])

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 <= 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:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x 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 = [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 c >= a 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 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 "No")

Submission status: Accepted

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

A,B,C=list(map(int,input().split()))
print('Yes' if A<=C<=B 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 c >= a and c <= b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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:
numbers = input()
number_list = [int(i) for i in numbers.split()]
if number_list[0] <= number_list[2] and number_list[2] <= number_list[1]:
  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 (C >= A) & (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<=b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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=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 and c<=b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print("Yes" if C in range(A, B+1) 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())

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 A <= C and C <=B else "No")

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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())

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("Yes") if a<=c and c<=b 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 = input().split()
a = int(a)
b = int(b)
c = int(c)

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:

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()

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

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())
ans = 'No'

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

print(ans)

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 = 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(['No','Yes'][a<=c<=b])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(ans)

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:
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()

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:
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,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 <= 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 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())

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())
print("Yes" if a <= c <= b else "No")

Submission status: Accepted

Solution code:
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()

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, 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 <= 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 B>=C:
  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:
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 C >= A and C <= B:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().strip().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:
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 = 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())
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 b>=c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    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()

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,b,c,=map(int,input().split())

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

Submission status: Accepted

Solution code:
# A - Between Two Integers
# https://atcoder.jp/contests/abc061/tasks/abc061_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=input().split()

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

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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()

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 = 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 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:
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)

Submission status: Accepted

Solution code:
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')

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 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())

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

Submission status: Accepted

Solution code:
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')

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:
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 c>b::2])

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=map(int,input().split());print(['Yes','No'][C<A or C>B])

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")
    raise SystemExit(0)
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 = list(map(int, input().split()))
print("Yes" if a <= c <= b else "No")

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
if x <= z <= y:
    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:
def main():
  num = list(map(int,input().split()))
  if(num[0]<=num[2] and num[2]<=num[1]):
    print('Yes')
  else:
    print('No')

main()

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('Yes' if A <= C and C<= B else 'No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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()

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-

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 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 <= 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)&(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 - Between Two Integers
# https://atcoder.jp/contests/abc061/tasks/abc061_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())
print('Yes' if a <= c <= b else 'No')

Submission status: Accepted

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

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')

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:
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 math import gcd,ceil,floor,factorial
# from fractions import gcd
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):
    # lsはソート済みであること
    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")

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:
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")

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
a,b,c = tuple(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("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 print ("No")

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:
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:
# -*- coding: utf-8 -*-
"""
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")