Problem:


Score : 100 points

Problem Statement

There are a total of A + B cats and dogs.
Among them, A are known to be cats, but the remaining B are not known to be either cats or dogs.

Determine if it is possible that there are exactly X cats among these A + B animals.

Constraints

1 \leq A \leq 100

1 \leq B \leq 100

1 \leq X \leq 200

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B X

Output

If it is possible that there are exactly X cats, print YES; if it is impossible, print NO.

Sample Input 1

3 5 4

Sample Output 1

YES

If there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.

Sample Input 2

2 2 6

Sample Output 2

NO

Even if all of the B = 2 animals are cats, there are less than X = 6 cats in total.

Sample Input 3

5 3 2

Sample Output 3

NO

Even if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.



Sample input:
3 5 4


Sample output:
YES

Submission status: Accepted

Solution code:
A,B,X=input().split()
a=int(A)
b=int(B)
x=int(X)
if a<=x<=a+b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if x >=a and x<=a+b:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if a <= x and a + b >= x:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

if a <= x <= a+b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

flg = "NO"

if a<= x and x<=(a+b):
    flg = "YES"
    
print(flg)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
if a<=x and x<=a+b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if x > a+b or a > x:
    print('NO')
else:
    print('YES')

Submission status: Accepted

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

if a <= x:
    if (a+b) >= x:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
if A <= X and X <= A+B:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A, B, X = [int(x) for x in input().split()]
if A + B < X:
  print("NO")
elif A > X:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
a,b,x=map(int, input().split())
print("YES" if a<=x<=a+b else "NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

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

def solve(A: int, B: int, X: int):
    print(YES if A <= X <= A+B else NO)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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
    X = int(next(tokens))  # type: int
    solve(A, B, X)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, X = map(int, raw_input().split())
if 0 <= X - A and X - A <= B: print 'YES'
else: print 'NO'

Submission status: Accepted

Solution code:

a,b,x=map(int,input().split())
if a<=x<=a+b:
    ans='YES'
else:
    ans='NO'
print(ans)

Submission status: Accepted

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

if a <= x <= a + b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

if 0 <= X - A <= B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

if a<=x and b>(x-a):
    print("YES")

else:
    print("NO")

Submission status: Accepted

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

print("YES" if a <= x <= a+b else "NO")

Submission status: Accepted

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

if A <= X and (A+B) >= X:
    print ('YES')
else:
    print ('NO')

Submission status: Accepted

Solution code:
a,b,x = map(int, input().split())
if a+b >= x and a <= x:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
print("YES" if (A <= X <= A + B) else "NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

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

def solve(A: int, B: int, X: int):
    if X >= A and X - A <= B:
        ret = YES
    else:
        ret = NO
    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
    X = int(next(tokens))  # type: int
    solve(A, B, X)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
print("YES" if a<=x and a+b>=x else "NO")

Submission status: Accepted

Solution code:
A,B,X=(int(i) for i in input().split())
if A<=X<=A+B:
   print('YES')
else:
   print('NO')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split(" "))
if a < c and a+b >c :
	print("YES")
elif a==c:
	print("YES")
else :
	print("NO")

Submission status: Accepted

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

if (x >= a) and (a+b >= x) :
    print("YES")
else :
    print("NO")

Submission status: Accepted

Solution code:
numberOfCat,unidentifiedNumber,totalCatNumber=input().split(" ")
numberOfCat = int(numberOfCat)                            #int変換
unidentifiedNumber = int(unidentifiedNumber)                          #int変換
totalCatNumber = int(totalCatNumber)

if numberOfCat > totalCatNumber or (numberOfCat + unidentifiedNumber) < totalCatNumber:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


def main():
    a, b, x = intin()

    if x >= a and x <= a + b:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B,X = map(int, input().split())
if A <= X <= A + B:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

print("YES" if X >= A and (X - A) <= B else "NO")

Submission status: Accepted

Solution code:
a, b, x = input().split()
a, b, x = int(a), int(b), int(x)
if x >= a and x <= a+b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,x = map(int, input().split())
if x < a:
    print("NO")
elif (a+b) >= x:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if a <= x:
    if a + b >= x:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

Solution code:
A, B, X = map(int, input().rstrip().split())
print("YES" if A <= X and A+B > X else "NO")

Submission status: Accepted

Solution code:

l = list(map(int, input().split()))

if (l[0] + l[1]) > l[2] and l[0] <= l[2]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
if A>X:
    print("NO")
if A<=X:
    if (A +B)<X:
        print("NO")
    else:
        print("YES")

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
all = A + B
print("YES" if all >= X >= A else "NO")

Submission status: Accepted

Solution code:
a, b, x = [int(i) for i in input().split()]
if a <= x and (a+b) >= x:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a , b , x = map(int,input().split())
if a <= x <= a+b :
  ans ='YES'
else :
  ans = 'NO'
print(ans)

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
if A > X:
    print("NO")
if A<= X:
    if (A + B)< X:
        print("NO")
    else:
        print("YES")

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
if x-a>=0 and b>=x-a:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
b, c, x = map(int, input().split())
if(b+c >= x and b <= x):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
if a<=x and a+b>=x:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:


def main():
    a, b , x = map(int, input().split())

    if a <= x <= a + b:
        print('YES')
    else:
        print('NO')






if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, X = map(int,input().split())
if A > X:
    print('NO')
elif B >= X-A:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

if A > X:
  print("NO")
elif A+B < X:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
a,b,x =map(int,input().split())
if a<=x and b >= x-a:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

if a <= x and a+b >= x:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# 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 0<= c-a <=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, x = f()
    if x>=a and x<= a+b:
        print('YES')
    else:
        print('NO')

solve()

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
print('YES' if 0<=x-a<=b else 'NO')

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
 
if a <= x <= a + b:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
ans = "YES"
if X < A or A+B < X:
    ans = "NO"

print(ans)

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if x-a >= 0 and a+b >= x:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a, b, x = map(int,input().split())
if a <= x <= a+b:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,x =map(int,input().split())
print('YES') if a <= x <= a+b else print('NO')

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
print("YES" if a<=x and b>=x-a else "NO")

Submission status: Accepted

Solution code:
a,b,x = list(map(int,input().split()))
if a <= x and x <= a + b:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

if A > X or A + B < X:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
a,b,x = map(int, input().split())
print("YES" if a<=x and a+b>=x else "NO")

Submission status: Accepted

Solution code:
A,B,X=map(int,input().split())
if A<=X and X<=A+B:
	print('YES')
else: print('NO')

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
if a > c or a+b < c:
  print("NO")
elif a+b > c:
  print("YES")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
if a-1<x<a+b+1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
if 0<=x-a<=b:
 print("YES")
else:
 print("NO")

Submission status: Accepted

Solution code:


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


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

    if a <= x <= a + b:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
a, b, x = [int(i) for i in input().split()]
if x >= a and x <= a+b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

if (a + b) >= x and a <= x:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
print('YES' if X-A <= B and X-A>=0 else 'NO')

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
print('YES' if a+b >= x and a<=x else 'NO')

Submission status: Accepted

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

if a<=x and a+b>=x:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
print('YES' if a <= x and a+b >= x else 'NO')

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if a > x:
  print('NO')
elif a + b < x:
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
a, b, x = (int(_) for _ in input().split())  

if a <= x and x <= a + b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

print('YES') if a <= x <= (a + b) else print('NO')

Submission status: Accepted

Solution code:
a,b,c=list(map(int,input().split()))
print("YES") if a<=c<=(a+b) else print("NO")

Submission status: Accepted

Solution code:
a,b,x=list(map(int, input().split()))
print("YES" if 0<=(x-a)<=b else "NO")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
 
if (a <= x) and (a + b >= x):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
print('YES' if A <= X and A + B >= X else 'NO')

Submission status: Accepted

Solution code:
def main():
	A, B, X = map(int, input().split())
	if X <= A+B and A <= X:
		print("YES")
	else:
		print("NO")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
if A+B >=X and A<=X:
	print('YES')
else:
	print('NO')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if B + A < X or A > X:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
[A,B,X] = list(map(int,input().split()))
if A <= X <= A+B:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
if a + b >= x and a <= x:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if A > X or A + B < X:
  print('NO')
else:
  print('YES')

Submission status: Accepted

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

Submission status: Accepted

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

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

if a<=x and x<a+b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(["NO","YES"][a+b >= c and a <= c ])

Submission status: Accepted

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

if X <= A+B:
    if X >= A:
        print("YES")
        exit()
print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import functools

import os

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 debug(fn):
    if not os.getenv('LOCAL'):
        return fn

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

    return wrapper


a, b, x = inl()
if a <= x and a + b >= x:
    print("YES")
else:
    print('NO')

Submission status: Accepted

Solution code:
A,B,X = list(map(int,input().split()))
if A<=X<=A+B:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
if A<=X<=A+B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

if B >= X-A >= 0:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

if a+b>=x>=a:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
# ABC094A - Cats and Dogs
a, b, x = list(map(int, input().rstrip().split()))
print("YES" if a <= x <= a + b else "NO")

Submission status: Accepted

Solution code:
# ABC094A - Cats and Dogs
a, b, x = list(map(int, input().rstrip().split()))
print("YES" if a <= x and a + b >= x else "NO")

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())
if A + B >= C:
    if A <= C:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if a <= x <= a + b:
	print("YES")
else:
	print("NO")

Submission status: Accepted

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

if A+B >= X >= A:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
input_data = input().split(" ")
a, b, x = int(input_data[0]), int(input_data[1]), int(input_data[2])
def check(A, B, X):
    if (A > X) or (A+B < X):
        return print("NO")
    inb_cat = X - A
    if inb_cat > B:
        return print("NO")

    else:
        return print("YES")


check(a, b, x)

Submission status: Accepted

Solution code:
# coding: utf-8

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

print("YES" if a <= x and a+b >= x else "NO")

Submission status: Accepted

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

if A+B >= X and A <= X:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
if a <= x <= a + b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
if A <= X and X <= A + B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A,B,X = map(int,input().split())
if A <= X and A + B >= X:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

if x - a >= 0 and b + x - a >= 0 and x <= a + b:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A,B,X = map(int, input().split())
if A>X:
  print("NO")
else:
  print("YES" if X-A<=B else "NO")

Submission status: Accepted

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

if (x >= a) and ((a+b)>=x): print('YES')
else: print('NO')

Submission status: Accepted

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

print("NO" if X < A or X > A + B else "YES")

Submission status: Accepted

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

if X >= A and A + B >= X:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
if x >= a and x <= (a + b) :
        print('YES')
else :
        print('NO')

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if 0 <= x-a <= b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
A,B,X=map(int, input().split())
print("YES" if A<=X and A+B>=X else "NO")

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
print('YES' if A<=X<=A+B else 'NO')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if A <= X and X <= A + B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
print("YES" if A <= X and A+B >= X else "NO")

Submission status: Accepted

Solution code:
A, B, X = map(int,input().split())
print('YES' if A <= X <= A + B  else 'NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#094
A,B,X= map(int,input().split())
if A+B>=X >=A:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
if a>x:
  print('NO')
elif (a+b)<x:
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if X <= A+B and X >= A:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
print('YES' if (l[0]+l[1]>=l[2])&(l[0]<=l[2]) else 'NO')

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if (a > x or a + b < x):
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]  # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()]  # LIST FLOAT
def LS(): return sys.stdin.readline().split()  # LIST STRING
def MI(): return map(int, sys.stdin.readline().split())  # MAP INT
def II(): return int(sys.stdin.readline())  # INPUT INT
def IS(): return input()  # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers):  # greatest common divisor
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):  # least common multiple
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))


a, b, x = MI()
print("YES") if a <= x <= a + b else print("NO")

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
print(["YES", "NO"][not(X <= A + B and A <= X)])

Submission status: Accepted

Solution code:
a, b, x=map(int, input().split())
if a==x:
  print("YES")
elif a<=x and  (x-a)<=b:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a, b, x = [int(_) for _ in input().split()]
print('YES' if x >= a and x <= (a+b) else 'NO')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if A+B >= X >= A:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

if A<=X and X<=(A+B):
        print('YES')
else: print("NO")

Submission status: Accepted

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

if A <= X and X <= A+B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

if A<=X and X<=A+B:
	print('YES')
else:
	print('NO')

Submission status: Accepted

Solution code:
A, B, X = list(map(int, input().split()))
if A > X:
  print("NO")
  exit()

if A + B < X:
  print("NO")
  exit()

print("YES")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
if x-a>=b or x<a:
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if A <= X and (A + B) >= X:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A, B, X = (int(x) for x in input().split())
if (A <= X) and ((A + B) >= X):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
print('YES' if a <= x <= a + b else 'NO')

Submission status: Accepted

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

if A <= X <= A+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 <= (a + b) else "NO")

Submission status: Accepted

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

if x < a:
    print('NO')
elif b > x - a:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
from sys import stdin
A,B,X=[int(x) for x in stdin.readline().rstrip().split()]
if A+B >= X and A <= X:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split());print("YNEOS"[a>x or a+b<x::2])

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if A > X:
    print('NO')
elif A + B >= X:
    print('YES')
elif A + B < X:
    print('NO')

Submission status: Accepted

Solution code:
A,B,X=map(int,input().split())
print('YES' if B>=(X-A)>=0 else 'NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

# -*- coding: utf-8 -*-

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

if a <= x <= a + b:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,b,x = map(int,input().split())
if a > x:
    print('NO')
else:
    if a+b-x>=0:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
a,b,x=map(int,input().split())
if a<=x:
    if a+b>=x:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if (x >= a):
    if (x-a <= b):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

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

if a > x or a + b < x:
  print("NO")
else:
  print("YES")

Submission status: Accepted

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

if a+b < x:
    print('NO')
elif a > x:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
a, b, x = map(int, input().split())
if a + b >= x and a <= x:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B, X = map(int, input().split())
if X < A:
    print('NO')
elif X <= A + B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if A+B < X:
    print("NO")
elif A > X:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

A, B, X = map(int, input().split())
if A <= X <= A + B:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A,B,X = [int(x) for x in input().split()]
if(A<=X and X<=A+B):
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if a[2] < a[0] or a[2] > a[0] + a[1]:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
def solve(string):
    a, b, x = map(int, string.split())
    return "YES" if 0 <= (x - a) <= b else "NO"


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, X = map(int, input().split())
if A<=X and (X-A)<=B:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

print("YNEOS"[x<a or a+b<x::2])

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print("YES") if a+b>=c>=a else print("NO")