#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main() {
    int tt;
    cin>>tt;
    while(tt--){
        int n;
        
        vector<int>v;
        cin>>n;
        vector <pair<int,int>>a(n);
        ll b[n];
        
        
        
        
        for(int i=0;i<n;i++){
            int a1;
            cin>>a1;
            a[i]={a1,i};
            
        }
        
        
        sort(a.begin(),a.end());
        
        b[0]=a[0].first;
         for (int i =1;i<n;i++){
            b[i]=b[i-1]+a[i].first;
        }
        
        
        int i;
        for(i=n-2;i>=0;i--){
            if(b[i]<a[i+1].first){
                break;
            }
        }
        i++;
        
        cout<<n-i<<endl;
        
         for (int k =i;k<n;k++){
        
            v.push_back(a[k].second);
        }
        
        
        
        
        sort(v.begin(),v.end());
        for(int i=0;i<v.size();i++){
            cout<<v[i]+1<<" ";
        }
        cout<<endl;
    }
}