The first line contains a single integer $T$ ($1 \le T \le 100$), denoting the number of test cases.
For each test case, the first line contains a single integer $n$$(1 \le n \le 1000)$, denoting the number of stars.
Each of the following $n$ lines describes a stars. The $i$-th line of them contains 4 integers $x_i, y_i, u_i, v_i(-1000 \le x_i,y_i \le 1000, 1 \leq u_i < v_i<P=31607)$ indicating the coordinate of the $i$-th star and the probability of the $i$-th star to become visible. It is guaranteed that no two stars share the same coordinate.
There are at most $3$ test cases satisfying $n>20$.