This is an interactive problem. The species of penguins that Blackslex is researching lives on an island that is a grid with (n) rows and (n) columns. Exactly one penguin lives in each one cell of the grid. He labelled each penguin as an integer from (1) to (n^2). After some time, some penguins migrated to another cell. After migration, every penguin will still be in some cell on the grid, and every cell contains exactly one penguin. He needs the current position of every penguin. To do so, he can ask a penguin how far another penguin is from it. Formally, for a possible grid (x) representing the position of all penguins, denote (\operatorname{dist}(x, i, j)) as the Manhattan distance of the penguin (i) to the penguin (j) in (x)(^{\text{∗}}). There is a hidden grid (a) with (n) rows and (n) columns. You need to find a grid (b) that satisfies (b) has (n) rows and (n) columns. Each cell of (b) contains an integer from (1) to (n^2), which is a penguin's label. Each integer will be in a single cell. For all (1 \leq i, j \leq n^2), it holds that (\operatorname{dist}(a, i, j) = \operatorname{dist}(b, i, j)). To do so, you may make the following query no more than (3n^2 + 150) times. Given (i), (j) ((1 \leq i, j \leq n^2)), receive the value of (\operatorname{dist}(a, i, j)). (^{\text{∗}})Let (r_i), (c_i) denote the row and column that the penguin (i) is in, and denote the same for (r_j), (c_j), then the Manhattan distance is (|r_i - r_j| + |c_i - c_j|). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \leq t \leq 200)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((2 \leq n \leq 100)) — the size of the island. It is guaranteed that the total sum of all values of (n) across all test cases does not exce