import math
for _ in range(int(input())):
n = int(input())
print(n)
a = [int(i) for i in range(1,n+1)]
print(*a)
i = n-1
while i > 0:
a[i],a[i-1] = a[i-1],a[i]
print(*a)
i-=1#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++)
{
v[i]=i+1;
}
cout<<n<<endl;
for(int i=0;i<n;i++)
{
if(i==0)
{
for(int i=0;i<n;i++)
{
cout<<v[i]<<" ";
}
cout<<endl;
}
else
{
swap(v[i],v[i-1]);
for(int i=0;i<n;i++)
{
cout<<v[i]<<" ";
}
cout<<endl;
}
}
}
}
489A - SwapSort | 932A - Palindromic Supersequence |
433A - Kitahara Haruki's Gift | 672A - Summer Camp |
1277A - Happy Birthday Polycarp | 577A - Multiplication Table |
817C - Really Big Numbers | 1355A - Sequence with Digits |
977B - Two-gram | 993A - Two Squares |
1659D - Reverse Sort Sum | 1659A - Red Versus Blue |
1659B - Bit Flipping | 1480B - The Great Hero |
1519B - The Cake Is a Lie | 1659C - Line Empire |
515A - Drazil and Date | 1084B - Kvass and the Fair Nut |
1101A - Minimum Integer | 985D - Sand Fortress |
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |