#include const long long INF = 1LL << 60; const long long MOD = 1000000007; const double PI = acos(-1.0); #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep1(i, n) for (ll i = 1; i <= (n); ++i) #define rrep(i, n) for (ll i = (n - 1); i >= 0; --i) #define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c))) #define ALL(obj) (obj).begin(), (obj).end() #define RALL(obj) (obj).rbegin(), (obj).rend() #define pb push_back #define to_s to_string #define len(v) (ll)v.size() #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define print(x) cout << (x) << '\n' #define drop(x) cout << (x) << '\n', exit(0) #define debug(x) cout << #x << ": " << (x) << '\n' using namespace std; using ll = long long; typedef pair P; typedef vector vec; typedef vector> vec2; typedef vector>> vec3; template inline bool chmax(S &a, const T &b) { if (a inline bool chmin(S &a, const T &b) { if (b ostream &operator << (ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator >> (istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T1, typename T2, typename T3 > ostream &operator << (ostream &os, const tuple< T1, T2, T3 > &t) { os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t); return os; } template< typename T1, typename T2, typename T3 > istream &operator >> (istream &is, tuple< T1, T2, T3 > &t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t); return is; } template< typename T > ostream &operator << (ostream &os, const vector< T > &v){ for (int i = 0; i < (int)v.size(); ++i) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator >> (istream &is, vector< T > &v){ for(T &in : v) is >> in; return is; } /*--------------------------------- Tools ------------------------------------------*/ template< typename T > vector cumsum(const vector &X){ vector res(X.size() + 1, 0); for(int i = 0; i < X.size(); ++i) res[i + 1] += res[i] + X[i]; return res; } template< typename S, typename T, typename F> pair bisearch(S left, T right, F f) { while(abs(right - left) > 1){ T mid = (right + left) / 2; if(f(mid)) right = mid; else left = mid; } return {left, right}; } template< typename S, typename T, typename F> double trisearch(S left, T right, F f, int maxLoop = 90){ double low = left, high = right; while(maxLoop--){ double mid_left = high / 3 + low * 2 / 3; double mid_right = high * 2 / 3 + low / 3; if(f(mid_left) >= f(mid_right)) low = mid_left; else high = mid_right; } return (low + high) * 0.5; } template< typename F > ll ternarySearch(ll L, ll R, F f) { //[L, R) ll lo = L - 1, hi = R - 1; while (lo + 1 != hi) { ll mi = (lo + hi) / 2; if (f(mi) <= f(mi + 1)) hi = mi; else lo = mi; } return hi; } /*------------------------------- Main Code Here -----------------------------------------*/ int main() { ll a, b, c, d; cin >> a >> b >> c >> d; if(a < b and c > d){ drop("YES"); } drop("NO"); return 0; }