#include<bits/stdc++.h>
using namespace std;
#define ll long long 
int n,t;
ll a[200005],s[200005],z[200005],f[200005];
int main(){
    freopen("bought.in","r",stdin);
    freopen("bought.out","w",stdout);
    scanf("%d",&t);
    while(t--){
        vector<int>ans;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
            s[i]=s[i-1]+a[i];
            if(a[i]<0)f[i]=f[i-1]-a[i],z[i]=z[i-1];
            else z[i]=z[i-1]+a[i],f[i]=f[i-1];
        }
        int i=n;
        while(i!=0&&a[i]<0){
            i--;
        }
        while(i!=0){
            for(int j=i;j>=1;j--){
                if(a[j]>0){
                    if(z[j]<f[j]){
                        ans.push_back(j);
                        for(int k=j;k>=1;k--)a[k]=-a[k],swap(z[k],f[k]);
                        for(int k=j+1;k<=n;k++){
                            if(a[k]<0)f[k]=f[k-1]-a[k],z[k]=z[k-1];
                            else z[k]=z[k-1]+a[k],f[k]=f[k-1];
                        }
                        break;
                    }
                }
            }
            i--;
        }
        printf("%d\n",ans.size());
        for(int j=0;j<ans.size();j++)printf("%d ",ans[j]);
        printf("\n");
    }
    return 0;
}