B"The magical girl Nene has an n x n matrix a filled with zeroes. The j -th element of the i -th row of matrix a is denoted as a_{i, j} . She can perform operations of the following two types with this matrix: Nene wants to maximize the sum of all the numbers in the matrix sum limits_{i=1}^{n} sum limits_{j=1}^{n}a_{i,j} . She asks you to find the way to perform the operations so that this sum is maximized. As she doesn't want to make too many operations, you should provide a solution with no more than 2n operations. A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation ( 2 appears twice in the array), and [1,3,4] is also not a permutation ( n=3 but there is 4 in the array). Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 500 ). The description of test cases follows. The only line of each test case contains a single integer n ( 1 <= n <= 500 ) -- the size of the matrix a . It is guaranteed that the sum of n^2 over all test cases does not exceed 5 cdot 10^5 . For each test case, in the first line output two integers s and m ( 0 <= q m <= q 2n ) -- the maximum sum of the numbers in the matrix and the number of operations in your solution. In the k -th of the next m lines output the description of the k -th operation: Note that you don't need to minimize the number of operations used, you only should use no more than 2n operations. It can be shown that the maximum possible sum can always be obtained in no more than 2n operations. In the first test case, the maximum sum s=1 can be obtained in 1 operation by setting a_{1, 1}:=1 . In the second test case, the maximum sum s=7$"...