提示: 欢迎访问OurACM平台。
Problem 1393 Coplanar Points

Accept: 430    Submit: 776
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

Given four points in three dimensions, you need to determine whether they are coplanar.

Input

The input starts with an integer N (N < 250) which indicates the number of test cases followed. Each of the following N case consists of one input line. The line contains 12 integers. The 1st to the 3rd integer are the x-, y-, z-coordinate of the first point. The 4th to the 6th integer are the x-, y-, z-coordinate of the second point. And so on. The absolute values of all the input integers are less than 100.

Output

For each input, output either "Yes" (if the points are coplanar) or "No" (if the points are not coplanar) in a single line.

Sample Input

5 0 0 0 1 0 0 0 1 0 0 0 -99 0 0 0 10 10 0 17 23 0 -18 -99 0 0 0 0 3 3 3 99 99 99 23 -73 53 12 23 34 12 23 34 12 23 34 12 23 34 1 2 3 1 2 3 1 2 3 5 6 7

Sample Output

No Yes Yes Yes Yes

Source

2005 HKUST Local Contest

Submit  Back  Status  Discuss