#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 1;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long z = 0;
vector<long long> intersection(vector<long long> a, vector<long long> b) {
  vector<long long> v(4, 0);
  v[0] = max(a[0], b[0]);
  v[1] = max(a[1], b[1]);
  v[2] = min(a[2], b[2]);
  v[3] = min(a[3], b[3]);
  return v;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  vector<long long> b1(4);
  vector<long long> b2(4);
  vector<long long> w(4);
  for (int i = 0; i < 4; i++) {
    cin >> w[i];
  }
  for (int i = 0; i < 4; i++) {
    cin >> b1[i];
  }
  for (int i = 0; i < 4; i++) {
    cin >> b2[i];
  }
  vector<long long> b1w = intersection(b1, w);
  vector<long long> b2w = intersection(b2, w);
  vector<long long> wt = intersection(b1w, b2w);
  long long area_removed = max(z, b1w[3] - b1w[1]) * max(z, b1w[2] - b1w[0]) +
                           max(z, b2w[3] - b2w[1]) * max(z, b2w[2] - b2w[0]) -
                           max(z, wt[3] - wt[1]) * max(z, wt[2] - wt[0]);
  long long total = (w[3] - w[1]) * (w[2] - w[0]);
  if (total - area_removed <= 0) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
  }
}
