Intersection — Eolymp

Input

The input begins with a single integer indicating the number of test cases. Each test case consists of two sets of four lines, each describing a parallelepiped. The first line of each set provides the coordinates of one vertex of the parallelepiped, denoted as $x$ , $y$ , $z$ ( $- 10000 \leq x, y, z \leq 10000$ -10000 \le x, y, z \le 10000), separated by spaces. The following three lines describe three vectors (edges) $v_{1}$ v_1, $v_{2}$ v_2, $v_{3}$ v_3 that are adjacent to the given vertex.

Each vector $V_{i}$ V_i is represented as ( $x_{i}$ x_i, $y_{i}$ y_i, $z_{i}$ z_i) with the constraint ( $- 10000 \leq x_{i}, y_{i}, z_{i} \leq 10000$ -10000 \le x_i, y_i, z_i \le 10000).

Output

For each test case, output a single line: NO if the parallelepipeds do not intersect, and YES if they do intersect.

Examples

Example 1

Loading