## Algorithm

A. Pineapple Incident
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Ted has a pineapple. This pineapple is able to bark like a bulldog! At time t (in seconds) it barks for the first time. Then every s seconds after it, it barks twice with 1 second interval. Thus it barks at times tt + st + s + 1t + 2st + 2s + 1, etc.

Barney woke up in the morning and wants to eat the pineapple, but he can't eat it when it's barking. Barney plans to eat it at time x (in seconds), so he asked you to tell him if it's gonna bark at that time.

Input

The first and only line of input contains three integers ts and x (0 ≤ t, x ≤ 1092 ≤ s ≤ 109) — the time the pineapple barks for the first time, the pineapple barking interval, and the time Barney wants to eat the pineapple respectively.

Output

Print a single "YES" (without quotes) if the pineapple will bark at time x or a single "NO" (without quotes) otherwise in the only line of output.

Examples
input
Copy
3 10 4
output
Copy
NO
input
Copy
3 10 3
output
Copy
YES
input
Copy
3 8 51
output
Copy
YES
input
Copy
3 8 52
output
Copy
YES
Note

In the first and the second sample cases pineapple will bark at moments 31314, ..., so it won't bark at the moment 4 and will bark at the moment 3.

In the third and fourth sample cases pineapple will bark at moments 311121920272835364344515259, ..., so it will bark at both moments 51 and 52.

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int main() {
int t, s, x;
scanf("%d %d %d", &t, &s, &x);

if(x >= t && (t - x) % s == 0) {
puts("YES");
return 0;
}

--x;

if(x > t && (t - x) % s == 0) {
puts("YES");
return 0;
}

puts("NO");

return 0;
}
Copy The Code &

Input

cmd
3 10 4

Output

cmd
NO