import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct PT {
  real x, y, z;
  this(real x, real y, real z) {
    this.x = x;
    this.y = y;
    this.z = z;
  }
  PT opBinary(string op)(PT a) const {
    static if (op == "+") {
      return PT(x + a.x, y + a.y, z + a.z);
    } else static if (op == "-") {
      return PT(x - a.x, y - a.y, z - a.z);
    } else {
      static assert(false);
    }
  }
  PT opBinary(string op)(real k) const {
    static if (op == "*") {
      return PT(x * k, y * k, z * k);
    } else static if (op == "/") {
      return PT(x / k, y / k, z / k);
    } else {
      static assert(false);
    }
  }
  real dot(PT a) const {
    return x * a.x + y * a.y + z * a.z;
  }
  PT cross(PT a) const {
    return PT(y * a.z - z * a.y, z * a.x - x * a.z, x * a.y - y * a.x);
  }
}

PT readPT() {
  const x = readReal();
  const y = readReal();
  const z = readReal();
  return PT(x, y, z);
}

void main() {
  try {
    for (; ; ) {
      auto A = readPT();
      auto B = readPT();
      auto C = readPT();
      auto D = readPT();
      
      B = B - A;
      C = C - A;
      D = D - A;
      const n = B.cross(C);
      const d = D - n * n.dot(D) / n.dot(n);
      debug {
        writeln("d = ", d);
      }
      
      const p = B.dot(d) / B.dot(B);
      const q = C.dot(d - B * p) / C.dot(C);
      debug {
        writeln("p = ", p, ", q = ", q);
      }
      
      const ans = (0.0 <= p && 0.0 <= q && p + q <= 1.0);
      writeln(ans ? "YES" : "NO");
    }
  } catch (EOFException e) {
  }
}