#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;
#define int long long
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define fr(i,k,n) for(int i=k;i<n;i++)
#define mod 1000000007


 const int  max_l=10;
struct player{
    int tok;
    int num;
};
bool comp(player a ,player b)
{
    return a.tok>b.tok;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin>>t;
    while(t--)
    {
     int n;
     cin>>n;
     int arr[n+1];

     int total=0;
     for(int i=1;i<=n;i++)
     {cin>>arr[i];
     total+=arr[i];}
     player pp[n];
     for(int i=1;i<=n;i++)
     {
         pp[i-1].num=i;
         pp[i-1].tok=arr[i];
     }

     sort(pp,pp+n,comp);
     set<int> ans;
     player prev=pp[0];
     ans.insert(pp[0].num);

     int i=1;
        int sum=total-prev.tok;
     while(i<n)
     {

         if(sum>=prev.tok&&ans.find(prev.num)!=ans.end())
             ans.insert(pp[i].num);
             sum-=pp[i].tok;
             prev=pp[i];
         i++;
     }
cout<<ans.size()<<endl;
     for(auto it:ans)
        cout<<it<<" ";
    cout<<endl;

    }

    return 0;
}
