Triangle

Heewon got two triangles sitting in three-dimensional space as a birthday present. Each triangle is made of three very thin segments, and a segment does not bend no matter how hard you press it.

Heewon wants to keep only one triangle, so she wants to move the two triangles far apart from each other. Sliding a triangle is allowed, and so is rotating it. Write a program that decides whether the two triangles can be pulled apart this way, or whether they are tangled with each other.

The first line contains the number of test cases $T$ ($1 \le T \le 1000$). Each test case takes two lines. The first line has nine integers $x_1$, $y_1$, $z_1$, $x_2$, $y_2$, $z_2$, $x_3$, $y_3$, $z_3$, the vertices of the first triangle, and the second line has nine integers $x'_1$, $y'_1$, $z'_1$, $x'_2$, $y'_2$, $z'_2$, $x'_3$, $y'_3$, $z'_3$, the vertices of the second triangle. Every coordinate is between $-1000$ and $1000$.

The three vertices of each triangle are not on one line. No side of one triangle meets a side of the other triangle, and no single plane contains both triangles.

For each test case, print YES if the two triangles are tangled, and NO if they can be moved far apart from each other. Print each answer on its own line.