#include using namespace std; using VI = vector; using VVI = vector; using PII = pair; using LL = long long; using VL = vector; using VVL = vector; using PLL = pair; using VS = vector; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define EB emplace_back #define MP make_pair #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define FF first #define SS second #define DUMP(x) cout<<#x<<":"<<(x)< istream& operator>>(istream& is, pair& p){ return is >> p.FF >> p.SS; } template istream& operator>>(istream& is, vector& xs){ for(auto& x: xs) is >> x; return is; } template ostream& operator<<(ostream& os, const pair& p){ return os << p.FF << " " << p.SS; } template ostream& operator<<(ostream& os, const vector& xs){ for(unsigned int i=0;i void maxi(T& x, T y){ if(x < y) x = y; } template void mini(T& x, T y){ if(x > y) x = y; } const double EPS = 1e-10; const double PI = acos(-1.0); const LL MOD = 1e9+7; int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N, M, X; cin >> N >> M >> X; cout << (X-(N-M) >= 3? "YES": "NO") << endl; return 0; }