codeforces C. Matching Numbers

 一、题目：

You are given an integer n�. Pair the integers 11 to 2n2� (i.e. each integer should be in exactly one pair) so that each sum of matched pairs is consecutive and distinct.

Formally, let (ai,bi)(��,��) be the pairs that you matched. {a1,b1,a2,b2,…,an,bn}{�1,�1,�2,�2,…,��,��} should be a permutation of {1,2,…,2n}{1,2,…,2�}. Let the sorted list of {a1+b1,a2+b2,…,an+bn}{�1+�1,�2+�2,…,��+��} be s1<s2<…<sn�1<�2<…<��. We must have si+1−si=1��+1−��=1 for 1≤i≤n−11≤�≤�−1.

Input

Each test contains multiple test cases. The first line contains the number of test cases t� (1≤t≤5001≤�≤500). The description of the test cases follows.