#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    double eps = 1e-10;
    double a, b, c, d, e, f, g, h;
    while(cin >> a >> b >> c >> d >> e >> f >> g >> h){
        double l1 = max(a, e), l2 = max(b, f);
        double r1 = min(c, g), r2 = min(d, h);
        if(l1 <= r1+eps && l2 <= r2+eps) puts("YES");
        else puts("NO");
    }
    return 0;
}
