#include<bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
#define fi first
#define se second
void solve()
{
    int n;
    cin>>n;
    vector<int>ar(n + 1),idx(n + 1,-1);
    int res = 0;
    for(int i = 1;i <= n;i ++)
        cin>>ar[i];
    vector<int>ans;
    vector<int>vis(n + 1);
    bool ok = 0;
    for(int i = 1;i <= n;i ++)
    {
        if(ar[i] != i)
        {
            int res = i;
            int cnt = 1;
            vis[res] =1 ;
            ans.push_back(res);
            while(ar[res] != i)
            {
                ans.push_back(ar[res]);                
                vis[ar[res]] = 1;
                swap(ar[res],ar[ar[res]]);
                cnt ++;
            }
            if(cnt != n)
                ok = 1;

        }
        else
            if(!vis[i])
                ans.push_back(i),ok = 1;
        if(ok)
            break;
    }
    if(ok)
    {
        cout<<n<<"\n";
        cout<<(int)ans.size()<<"\n";
        for(auto v:ans)
            cout<<v<<" ";
        cout<<"\n";
    }
    else
    {
        cout<<n - 2<<"\n";
        vector<int>anss;
        for(int i = 0;i < n / 2;i ++)
        {
            if(ans[i] == 2)
                break;
            anss.push_back(ans[i]);
        }
        cout<<(int)anss.size()<<"\n";
        for(auto v:anss)
            cout<<v<<" ";
        cout<<"\n";
    }
    
}
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T;
    cin>>T;
    while(T --)
        solve();
}