C.cpp

#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<n;i++)
#define fo2(i,start,end) for(i=start;i<=end;i++)
#define rfo(i,n) for(i=n-1;i>=0;i--)
#define ll long long int
#define deb(x) cout<<#x<<"="<<x<<endl
#define deb2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define tr(it,a) for(auto it=a.begin(); it!=a.end();it++)
#define nl '\n'
#define PI 3.1415926535897932384626
#define mod 1000000007
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pl;
typedef vector<int>		vi;
typedef vector<ll>		vl;
typedef vector<pii>		vpii;
typedef vector<pl>		vpl;
const int N=1e6+10;

void solve(){
    int i,j;
    int n;
    cin>>n;
    int a[n];
    fo(i,n){
        cin>>a[i];
    }
    int flag=-2;
    fo(i,n-1){
        if(a[i]==0 && a[i+1]==1){
            flag=i;
            break;
        }
    }
    if(a[n-1]==0){
        flag=n-1;
    }
    if(a[0]==1){
        flag=-1;
    }
    if(flag==-2){
        cout<<-1;
        return;
    }
    // deb(flag);
    if(flag==-1){
        cout<<n+1<<" ";
    }
    fo(i,n){
        cout<<i+1<<" ";
        if(i==flag){
            cout<<n+1<<" ";         
        }
    }
    cout<<nl;
}

int main(){
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    
}