# encoding:utf-8

import copy

import numpy as np

import random





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



if a<= x <= a+b:

    ans = True

else:

    ans = False



if ans:

    print("YES")

else:

    print("NO")

#!/usr/bin/env python3

# encoding:utf-8

import copy

import random

import bisect #bisect_left　これで二部探索の大小検索が行える

import fractions #最小公倍数などはこっち

import math

import sys

import collections

from decimal import Decimal # 10進数で考慮できる



mod = 10**9+7

sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000



d = collections.deque()

def LI(): return list(map(int, sys.stdin.readline().split()))



A, B, X = LI()



if A <= X <= A + B:

    print("YES")

else:

    print("NO")
# encoding:utf-8
import copy
import numpy as np
import random

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

#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect  # bisect_left　これで二部探索の大小検索が行える
import fractions  # 最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal  # 10進数で考慮できる

mod = 10**9 + 7
sys.setrecursionlimit(mod)  # 再帰回数上限はでdefault1000
d = collections.deque()


def LI():
    return list(map(int, sys.stdin.readline().split()))


A, B, X = LI()
if A <= X <= A + B:
    print("YES")
else:
    print("NO")

+#!/usr/bin/env python3 -import numpy as np +import bisect  # bisect_left　これで二部探索の大小検索が行える +import fractions  # 最小公倍数などはこっち +import math +import sys +import collections +from decimal import Decimal  # 10進数で考慮できる -a, b, x = list(map(int, input().split())) -if a <= x <= a + b: -    ans = True -else: -    ans = False -if ans: +mod = 10**9 + 7 +sys.setrecursionlimit(mod)  # 再帰回数上限はでdefault1000 +d = collections.deque() + + +def LI(): +    return list(map(int, sys.stdin.readline().split())) + + +A, B, X = LI() +if A <= X <= A + B: