All Tracks Math Problem

Destroy the machine
Tag(s):

Very-Easy

Problem
Editorial
Analytics

Jack has a machine. At time T (in seconds) it runs for the first time. Then every D seconds after it, it runs twice with 1 second interval. Thus it runs at times T, T + D, T + D + 1, T + 2D, T + 2D + 1, etc.

now due to some reasons he wants to destroy the machine but he can not do it in running state of machine Jack plans to destroy it at time x (in seconds), so he asked you to tell him if it's in running state at that time.

Input

  • The first and only line of input contains three integers T, D and x (0≤ T, x ≤ 10^9,2 ≤ D ≤ 10^9) — the time the machine runs for the first time, the machine running interval, and the time at which Jack wants to destroy the machine respectively.

Output

  • Print a single "YES" (without quotes) if the machine is running at time x or a single "NO" (without quotes) otherwise in the only line of output.
SAMPLE INPUT
3 10 4
SAMPLE OUTPUT
NO
Explanation

In the sample case machine will run at moments 3, 13, 14, ..., so it won't be running at the moment 4 . so output for case 1 is NO .

Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala 2.11.8, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

This Problem was Asked in

Malaviya National Institute of Technology

Challenge Name

Code_lock V 1.0

OTHER PROBLEMS OF THIS CHALLENGE
Notifications
View All Notifications