#include <bits/stdc++.h>
template <typename T>
T power(T e, T n, T m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = mod(x * p, m);
    p = mod(p * p, m);
    n >>= 1;
  }
  return x;
}
template <typename T>
T InverseEuler(T a, T m) {
  return (a == 1 ? 1 : power(a, m - 2, m));
}
template <typename T>
T gcd(T a, T b) {
  return __gcd(a, b);
}
template <typename T>
T lcm(T a, T b) {
  return (a * (b / gcd(a, b)));
}
using namespace std;
const int MAX = 1005;
int main() {
  long int t, s, x;
  cin >> t >> s >> x;
  if (x == t) {
    cout << "YES\n";
    return 0;
  }
  if (x >= t + s) {
    x -= t;
    if (x % s == 1 || x % s == 0) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  } else {
    cout << "NO\n";
  }
  return 0;
}
