Consider a permutation (p) of (1, 2, \ldots, n). Let (s_i) denote the number of inversions in the entire prefix (p_1, p_2, \ldots, p_i), defined as: () s_i = \sum_{1 \le x \lt y \le i} p_x \gt p_y, () where the square parantheses denote the Iverson bracket notation. For each position (i) ((1 \le i \le n)), you are given a condition in the form of either (p_i = x) or (s_i = x). Your task is to reconstruct the original permutation (p). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. For each test case: The first line contains a single integer (n) ((1 \le n \le 2\cdot 10^5)). Each of the following (n) lines contains a character (c) ((c \in \{\text{'p'}, \text{'s'}\})) and an integer (x): If (c = \text{'p'}), it denotes that (p_i = x), where (1 \le x \le n). If (c = \text{'s'}), it denotes that (s_i = x), where (0 \le x \le \frac{i(i-1)}{2}). The sum of (n) over all test cases does not exceed (2\cdot 10^5). It is guaranteed that a valid permutation always exists. For each test case, output (n) integers representing the permutation (p). If there are multiple valid permutations, you can output any of them. In the first test case, the values of all elements are explicitly given, so the unique valid permutation is (\{1, 2, 3\}). In the second test case, we need to reconstruct the permutation from the prefix inversion counts: For position (2), the number of inversions increases by (s_2 - s_1 = 1 - 0 = 1). This means (p_2) must be smaller than exactly one element before it, so (p_1 \gt p_2). For position (3), the number of inversions increases by (s_3 - s_2 = 2 - 1 = 1). This means (p_3) is smaller than exactly one element before it. In the third test case, we are given (p_1 = 1) and (p_3 = 2). The only