#include <iostream>
#include <cmath>
#define mul(s, t) ((s-t)*(s-t))

using namespace std;

int main()
{
	double x[3], y[3], u[2], s, t, v, p, q, r, a, b, c;
	
	while(cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> s >> t){
		bool f = true;
		for(int i = 0; i < 3; i++){
			int p = 0;
			for(int j = 0; j < 3; j++){
				if(i != j){
					u[p++] = sqrt(mul(x[i], x[j])+mul(y[i], y[j]));
				}
			}
			v = sqrt(mul(x[i], s)+mul(y[i], t));
			
			if(u[0] <= v && u[1] <= v){
				f = false;
				break;
			}
		}
		
		if(f){
			a = sqrt(mul(x[0],x[1])+mul(y[0],y[1]));
			b = sqrt(mul(x[0],x[2])+mul(y[0],y[2]));
			c = sqrt(mul(x[2],x[1])+mul(y[2],y[1]));
			p = (a+b+c)/2;
			q = sqrt(p*(p-a)*(p-b)*(p-c));
			
			for(int i = 0; i < 3; i++){
				for(int j = i+1; j < 3; j++){
					a = sqrt(mul(x[i],x[j])+mul(y[i],y[j]));
					b = sqrt(mul(s,x[j])+mul(t,y[j]));
					c = sqrt(mul(x[i],s)+mul(y[i],t));
					p = (a+b+c)/2;
					r = sqrt(p*(p-a)*(p-b)*(p-c));
					if(r > q){
						f = false;
						break;
					}
				}
				if(!f){
					break;
				}
			}
			if(f){
				cout << "YES" << endl;
			} else {
				cout << "NO" << endl;
			}
		} else {
			cout << "NO" << endl;
		}
	}
	
	return 0;
}