#include<bits/stdc++.h>
#define N 200005 
#define int long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,m,k,op,x,y,z,ans,last;
int a[N],s[N],h[N],f[N],p[N];
bool vis[N];
queue<int>q;
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 ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int fp(int a,int n,int mod){
    int ans=1;
    while(n){
        if(n&1)ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int po(int x){return x*x;}
int sub(int x,int y){return x>y?x-y:y-x;}
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("bought.in","r",stdin);freopen("bought.out","w",stdout);
    T=read();
    while(T--){
        ans=0;
        n=read();fo(i,1,n)ans+=a[i]=read(),s[i]=s[i-1]-a[i],vis[i]=0;
        h[n+1]=0;rf(i,n,1)h[i]=h[i+1]+a[i];
        x=0;y=0;
        int ax=0,ay=0;
        fo(i,1,n){
            f[i]=f[i-1]+a[i];p[i]=0;
            if(s[i]+x>f[i])f[i]=s[i]+x,p[i]=y;
            if(a[i]>0&&s[i]+x+h[i+1]>ans)ans=s[i]+x+h[i+1],ax=i,ay=y;
            if(f[i]-s[i]>x)x=f[i]-s[i],y=i;
        }
        if(!ax){printf("0\n\n");continue;}
        int now=1;
        for(int i=ay;i;){
            if(a[i]*now>0)vis[i]=1,q.push(i),now=-now;
            if(!p[i]){i--;continue;}
            i=p[i];
        }
        q.push(ax);
        for(int i=ay;i;){
            if(!vis[i])q.push(i);
            if(!p[i]){i--;continue;}
            i=p[i];
        }
        printf("%lld\n",q.size());
        while(!q.empty())printf("%lld ",q.front()),q.pop();
        printf("\n");
    }
    return 0;
}