Hide-and-Seek

2000ms

262144K

Description:

Victor and Peter are playing hide-and-seek. Peter has hidden, and Victor is to find him. In the room where they are playing, there is only one non-transparent wall and one double-sided mirror. Victor and Peter are points with coordinates (x_v, y_v) and (x_p, y_p) respectively. The wall is a segment joining points with coordinates (x_w, 1, y_w, 1) and (x_w, 2, y_w, 2), the mirror — a segment joining points (x_m, 1, y_m, 1) and (x_m, 2, y_m, 2).

If an obstacle has a common point with a line of vision, it's considered, that the boys can't see each other with this line of vision. If the mirror has a common point with the line of vision, it's considered, that the boys can see each other in the mirror, i.e. reflection takes place. The reflection process is governed by laws of physics — the angle of incidence is equal to the angle of reflection. The incident ray is in the same half-plane as the reflected ray, relative to the mirror. I.e. to see each other Victor and Peter should be to the same side of the line, containing the mirror (see example 1). If the line of vision is parallel to the mirror, reflection doesn't take place, and the mirror isn't regarded as an obstacle (see example 4).

Victor got interested if he can see Peter, while standing at the same spot. Help him solve this problem.

Input:

The first line contains two numbers x_v and y_v — coordinates of Victor.

The second line contains two numbers x_p and y_p — coordinates of Peter.

The third line contains 4 numbers x_w, 1, y_w, 1, x_w, 2, y_w, 2 — coordinates of the wall.

The forth line contains 4 numbers x_m, 1, y_m, 1, x_m, 2, y_m, 2 — coordinates of the mirror.

All the coordinates are integer numbers, and don't exceed 10⁴ in absolute value. It's guaranteed, that the segments don't have common points, Victor and Peter are not on any of the segments, coordinates of Victor and Peter aren't the same, the segments don't degenerate into points.

Output:

Output YES, if Victor can see Peter without leaving the initial spot. Otherwise output NO.

Sample Input:

Sample Output:

NO

Sample Input:

0 0
1 1
0 1 1 0
-100 -100 -101 -101

Sample Output:

NO

Sample Input:

Sample Output:

YES

Sample Input:

0 0
10 0
100 100 101 101
1 0 3 0

Sample Output:

YES

Informação

Provedor Codeforces

Código CF32E