#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
typedef long double ld;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second

ld norm(vector<ld> &v) {
	ld ret = 0;
	rep(i, 3) {
		ret += pow(v[i], 2);
	}
	return ret;
}
ld dot(vector<ld> &a,vector<ld> &b) {
	ld ret = 0;
	rep(i, 3) {
		ret += a[i] * b[i];
	}
	return ret;
}
void solve() {
	vector<ld> v[4];
	rep(i, 4) {
		v[i].resize(3);
		rep(j, 3) {
			cin >> v[i][j];
		}
	}
	vector<ld> a(3), x(3), y(3);
	rep(i, 3) {
		x[i] = v[1][i] - v[0][i];
		y[i] = v[2][i] - v[0][i];
		a[i] = v[3][i] - v[0][i];
	}
	ld b = norm(x)*norm(y) - pow(dot(x, y), 2);
	ld s = norm(y)*dot(a, x) - dot(x, y)*dot(a, y); s /= b;
	ld t = -dot(x, y)*dot(a, x) + norm(x)*dot(a, y); t /= b;
	if (s < 0 || t < 0 || s + t>1) {
		cout << "NO" << endl;
	}
	else {
		cout << "YES" << endl;
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
	//stop
	return 0;
}