There are (n) tasks for you. Task (i) has an integer value of (c_i) and a difficulty of (p_i). Also, you have an initial stamina of (1), which is denoted as (S). You should process the tasks from task (1) to task (n). For each task, you have two choices. Give up the task. This way, nothing will happen. Complete the task. This way, you will gain (S\cdot c_i) points. However, (S) will drop to (S\cdot (1-\frac{p_i}{100})) after the task is completed. You need to maximize your points after you finish the process. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^3)). The description of the test cases follows. The first line of each test cases contain an integer (n) ((1\le n\le10^5)) denoting the number of tasks. The following (n) lines contain two integers each, denoting (c_i) ((1\le c_i\le 100)) and (p_i) ((0\le p_i\le 100)). It is guaranteed that the sum of (n) over all test cases does not exceed (10^5). For each test case, output a single real number — the maximum possible points you can get. Your answer is considered correct if its absolute or relative error does not exceed (10^{-6}). Formally, let your answer be (a), and the jury's answer be (b). Your answer is accepted if and only if (\frac{|a−b|}{\max(1,|b|)}\le 10^{-6}). In the first test case, it's optimal to complete task (1) and (2) in order, gaining points of (10+20=30). In the second test case, it's optimal to complete task (1), give up task (2), and complete task (3). Before completing task (3), your stamina has dropped to (1-\frac{5}{100}=0.95). So your gain is (10+20\cdot 0.95=29) points in total.