# First Fruit

Time Limit: 1000 ms

Memory Limit: 65535 ms

## Description

In space coordinate, there are two lines.Now you can choose a point from each line.I want to make the distance of the two points the shortest.Now how do you choose the two points? It is promised that there is only one pair of the two points.How easy it is.Solve the problem first,so you can get a fruit.

## Input

The first line contains an integer t ( 1 <= t <= 100 ): the number of test cases. Then for each test case:First line contains six numbers x0,y0,z0,x1,y1,z1,where they are the positions of the two points in the first line.Second line contains six numbers x2,y2,z2,x3,y3,z3,where they are the positions of the two points in the second line.

## Output

For each test case, output the result in the form of sample.You should print the case number and the two points in the next two lines.(the point in the first line should be printed first.)

## Sample Input

1
4.0 16.0 96.0 46.0 72.0 46.0
33.0 47.0 70.0 50.0 35.0 14.0

## Sample Output

Case 1:
28.514 48.685 66.817
33.390 46.725 68.717

None