The first line contains an integer T$(1 \leq T \leq 5)$representing the number of test cases.
For each test case, the first line contains an integer n$(1 \leq n \leq 2*10^5)$ representing the number of the rockets.
the next $n$ line followed. the $i-th$ line contains the coordinates of the $i-th$ rocket $x_i,y_i$$(-10^9 \leq x_i,y_i \leq 10^9)$, the loss when it is covered $v_i$$(1 \leq v_i \leq 10^9)$, and the range of smoke $r_i$ $(0 \leq r_i \leq 10^9)$.
It is guaranteed that there are no more than 1 testcases with $n>10^5$
The rocket may land at the same coordinates
all test cases create by randomly