#include<bits/stdc++.h>
using namespace std;
int t;
int n;
const int N=1000005;
int a[N];
vector<int> v;
void dfs(int x)
{
    v.push_back(x);
    if (a[x]!=1)
        dfs(a[x]);
}
int main()
{
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d",&n);
        for (int i=1;i<=n;++i)
            scanf("%d",&a[i]);
        v.clear();
        dfs(1);
        if (v.size()!=n)
        {
            printf("%d\n%d\n",n,(int)v.size());
            sort(v.begin(),v.end());
            for (int x:v)
                printf("%d ",x);
            puts("");
        }
        else
        {
            for (int i=1;i<n;++i)
                if (v[i]==2)
                {
                    printf("%d\n%d\n",n-2,i);
                    for (int j=0;j<i;++j)
                        printf("%d ",v[i]);
                    puts("");
                    break;
                }
            // int mnp=1;
            // for (int i=2;i<=n;++i)
            //     if (abs(mnp-a[mnp])>abs(i-a[i]))
            //         mnp=i;
            // int ans=n-abs(mnp-a[mnp])-1;
            // printf("%d\n1\n%d\n",ans,mnp);
        }
    }
    return 0;
}