#include <bits/stdc++.h>
#define pb push_back 
using namespace std;
const int N=4e5+10;
const long long inf=-1e18;
int n,a[N],f[N][2][2],to[N][2][2];
long long dp[N][2][2];
vector<int> ans,v,p;
set<int> s;
void solve()
{
    cin>>n;ans.clear(),v.clear();
    for (int i=1;i<=n;i++) cin>>a[i];
    dp[n+1][0][0]=0,dp[n+1][1][0]=dp[n+1][0][1]=dp[n+1][1][1]=-1e18;
    for (int i=n;i>=1;i--)
    {
        dp[i][0][1]=dp[i][1][0]=dp[i][1][1]=-1e18;
        dp[i][0][0]=dp[i+1][0][0]+a[i];
        f[i][0][0]=0,to[i][0][0]=0;
        for (int j=0;j<2;j++)
        {
            long long cnt1=dp[i+1][j][1]+(j ? -a[i] : a[i]),cnt2=dp[i+1][j^1][1]+(j ? -a[i] : a[i]),cnt3=((a[i]>0 && j==1) ? dp[i+1][0][0]-a[i] : inf);
//            cout<<i<<" "<<j<<" "<<cnt1<<" "<<cnt2<<" "<<cnt3<<endl;
            if (cnt1>cnt2 && cnt1>cnt3) f[i][j][1]=0,dp[i][j][1]=cnt1,to[i][j][1]=1;
            else if (cnt2>cnt3) f[i][j][1]=1,dp[i][j][1]=cnt2,to[i][j][1]=1;
            else f[i][j][1]=1,dp[i][j][1]=cnt3,to[i][j][1]=0;
        }
    }
    int now=(max(dp[1][0][1],dp[1][0][0])>=dp[1][1][1] ? 0 : 1),x=(now==0 && dp[1][0][0]>dp[1][0][1] ? 0 : 1);
    for (int i=1;i<=n;i++)
    {
        if (f[i][now][x]) v.pb(i),x=to[i][now][x],now^=1;
    }
    for (auto &j:v)
    {
        if (a[j]>0)
        {
            ans.pb(j);
            for (auto &k:p) ans.pb(k);
            p.clear();
        }
        else p.pb(j); 
    }
    cout<<ans.size()<<"\n";
    for (auto &j:ans) cout<<j<<" ";
    cout<<"\n";
}
int main() {
    freopen("bought.in","r",stdin);
    freopen("bought.out","w",stdout);
    ios::sync_with_stdio(0),cin.tie(0);
    int t;
    cin>>t;
    while (t--) solve();
    return 0;
}