for _ in range(int(input())):
n = int(input())
l = [n-1,n]
ans = [i for i in range(n-2,0,-1)]
if len(ans)%2==1:
ans = [ans[-1]]+ans[:-1]
ans.extend(l)
print(*ans)#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
if(n%2!=0)
{
cout<<1<<" "<<2<<" "<<3<<" ";
for(int i=n-2;i>3;i--)
{
cout<<i<<" ";
}
cout<<n-1<<" "<<n<<endl;
}
else
{
for(int i=n-2;i>0;i--)
{
cout<<i<<" ";
}
cout<<n-1<<" "<<n<<endl;
}
}
}
467B - Fedor and New Game | 252C - Points on Line |
735C - Tennis Championship | 992A - Nastya and an Array |
554A - Kyoya and Photobooks | 79B - Colorful Field |
265B - Roadside Trees (Simplified Edition) | 1362C - Johnny and Another Rating Drop |
1214C - Bad Sequence | 1091B - New Year and the Treasure Geolocation |
244A - Dividing Orange | 1061C - Multiplicity |
1312A - Two Regular Polygons | 801A - Vicious Keyboard |
510B - Fox And Two Dots | 616D - Longest k-Good Segment |
1604A - Era | 555B - Case of Fugitive |
551A - GukiZ and Contest | 1399F - Yet Another Segments Subset |
1371C - A Cookie for You | 430B - Balls Game |
1263A - Sweet Problem | 1332B - Composite Coloring |
254A - Cards with Numbers | 215A - Bicycle Chain |
1288B - Yet Another Meme Problem | 1201C - Maximum Median |
435A - Queue on Bus Stop | 1409B - Minimum Product |