#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define N 200005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define mem(x) memset(x,0,sizeof(x))
#define sym() system("pause")
using namespace std;
int T,n,m,a[N],k,t[N],ans[N],op,x,y,z;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ud(int x){while(x<=n)t[x]++,x+=x&-x;}
int gs(int x){int sum=0;while(x)sum+=t[x],x&=x-1;return sum;}
int ab(int x){return x<0?-x:x;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("Shifts.in","r",stdin);freopen("Shifts.out","w",stdout);
    T=read();
    while(T--){
        int sum=0;
        n=read();fo(i,1,n)a[i]=read();
        fo(j,0,n-1){
            int tot=0,cnt=0;
            fo(i,1,n)cnt+=ab(a[i]-i);
            fo(i,1,n)t[i]=0;
            rf(i,n,1)tot+=gs(a[i]),ud(a[i]);
            if(tot*2==cnt)ans[++sum]=j;
            rf(i,n,2)swap(a[i],a[i-1]);
        }
        printf("%d\n",sum);
        fo(i,1,sum){printf("%d",ans[i]);if(i<sum)printf(" ");}
        printf("\n");
    }
    return 0;
}