You are given a grid of size \( N \times M\) where the top left square has coordinate (1,1) and bottom right square has coordinate (N,M).
You are given a coordinate \((X,Y)\) and you have rectangular bars of size \(L\times B\). You are dropping these bars randomly at any place on the grid (the bar should be inside the boundaries of the grid) one after the other, until one falls on \((X,Y)\).
Calculate the expected number of bars required to do so.

Input format
First line: T (number of test cases)
For each test case: Six space-separated integers N, M, L, B, X, and Y

Output format
Print the expected number of bars correctly up to exactly 6 places after decimal.

Constraints
\(1 \le T \le 100\)
\(1 \le N,M \le 10000\)
\(1 \le L,Y \le N\)
\(1 \le B,X \le M\)