#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
using namespace std;
int arr[2][2];
bool solve(int x, int y) {
  int cewe = arr[0][x];
  int cowo = arr[1][y];
  if (cowo >= cewe) {
    if (cewe >= (cowo - 1) / 2) {
      if (cewe > (cowo - 1) + 2) {
        return 0;
      } else
        return 1;
    } else
      return 0;
  } else {
    if (cowo >= cewe - 1) {
      if (cowo > (cewe - 1) + 2)
        return 0;
      else
        return 1;
    } else
      return 0;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (int i = 0; i < 2; ++i) {
    cin >> arr[i][0] >> arr[i][1];
  }
  bool ok = 0;
  ok |= solve(0, 1);
  ok |= solve(1, 0);
  if (ok)
    cout << "YES" << '\n';
  else
    cout << "NO" << '\n';
}
