Girlfriend
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

ZYT and ZFeT are great PUAs and both have two girlfriends,but they never think that their girlfriends could be so great at magic.

One day, when ZYT and ZFeT were busy training PU skills,they suddenly found themselves spelled by their girlfriends.

And their girlfriends told them that they would be freed after  years .

After examining carefully , they found the mechanism of the spell:
  1. ZYT must keep the distance between himself and his lover A no less than k_1 times the distance between himself and his lover B.
  2. ZFeT must keep the distance between himself and his lover C no less than k_2 times the distance between himself and his lover D.
Let P_1,P_2 denote the positions of ZYT and ZFeT, so that is:



As they immediately discovered:their available living places formed two geometric forms in space and they may has intersection inside.

Surely the intersection was far too enough for them to become more and more gay(I mean,happy) in these  years.

Wondered how gay they could be,they wanted to ask you the volume of of the intersection.

输入描述:

The first line of input contains a single integer  — the number of test cases.

Each test case consists of five lines:

The first four lines contains three integers (x_i,y_i,z_i), denoting the coordinates of points A,B,C,D.

Then another line contains two integers k_1,k_2, described as above.

输出描述:

Output  lines denoting the answer of each test case, answer with an error less than  (relatively or absolutely) will be accepted.
示例1

输入

复制
1
1 0 0
3 0 0
2 0 0
4 0 0
3 3

输出

复制
0.262

备注:

.For each test case, .

It's guaranteed that A,B,C,D share no duplicated position.