#include <bits/stdc++.h>

using namespace std;

struct pla{
  int a;
  int ind;
};

bool comp(pla a, pla b){
  return a.a>b.a;
}
bool com(pla a, pla b){
  return a.ind<b.ind;
}

int main(){
  long long t;
  cin>>t;
  while(t--){
    long long n,i,j,k;
    cin>>n;
    long long arr[n];
    pla ar[n];
    pla tem;
    for(i = 0;i<n;i++){
      cin>>arr[i];
      tem.ind = i;
      tem.a = arr[i];
      ar[i] = tem;
    }
    sort(arr,arr+n,greater<long long>());
    sort(ar,ar+n,comp);
    long long sum[n+1];
    sum[n] = 0;
    for(i = n-1;i>-1;i--){
      sum[i] = sum[i+1]+arr[i];
    }
    for(i = 1;i<n;i++){
      if(sum[i]<arr[i-1]){
        break;
      }
    }
    sort(ar,ar+i,com);
    cout<<i<<endl;
    for(j = 0;j<i;j++){
      cout<<ar[j].ind+1<<' ';
    }
    cout<<endl;
  }
}
