t, s, x = (int(i) for i in input().split())
if x < t:
print('NO')
else:
print(('NO', 'YES')[(x - t) % s == 0 or (x - 1 != t and (x - t - 1) % s == 0)])#include<bits/stdc++.h>
using namespace std;
#define aa() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
int main()
{
aa();
long long a,b,c;
cin>>a>>b>>c;
if(a>c)cout<<"NO"<<endl;
else if(a==c)cout<<"YES"<<endl;
else
{
bool flag=0;
long long d=0;
long long x=a;
while(x<=c)
{
d++;
if((a+(d*b))==c ||(a+(d*b)+1)==c)
{
flag=1;
break;
}
x=a+(d*b);
}
if(flag)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |