#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
*/
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i,a,b) for(ll i=a;i<=b;++i)
#define rrep(i,a,b) for(ll i=a;i>=b;--i)
#define FOR(i,n)  for(ll i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323846
#define fi first
#define se second
#define all(x)  x.begin(),x.end()
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

const ll INF = 1e18+10;
const ll mod = 1e9+7;
const ll MAXN = 2e5+10;

ll poww(ll a, ll b) {    
    if(b<0) return 0LL;
    ll ans = 1;
    while (b) {
        if (b & 1)ans = ans * a;
        a = a * a;
        b >>= 1;
    }   
    return ans;
}
ll binpow(ll a, ll b)
{
    if (b < 0) return 0LL;
    if (a <= 0)return 0LL;
    a %= mod;
    
    ll ans = 1LL;
    while (b) {
        if (b & 1)ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}
ll modinv(ll n) {
    return binpow(n, mod - 2);
}

void solve() {  
    ll n; cin>>n;
    vector<ll> x;
    ll a[n]; FOR(i,n) { cin>>a[i]; x.pb(a[i]); }
    sort(all(x));
    vector<ll> s(n,0); s[0] = x[0];
    ll j = 0;
    vector<ll> inv(n,1);
    for(ll i=1; i<n; i++) { 
        if(x[i]>s[i-1]) {
            for(ll k=i-1; k>=j; k--) {
                inv[k] = 0;
            }
            j = i;
        }
        s[i] = s[i-1] + x[i];
    }
    map<ll,ll> mt;
    FOR(i,n) {
        if(inv[i]==1) mt[x[i]] = 1;
    }
    vector<ll> ans;
    FOR(i,n) {
        if(mt[a[i]]==1) ans.pb(i+1);
    }
    cout<<ans.size()<<"\n";
    FOR(i,ans.size()) cout<<ans[i]<<" ";
    cout<<"\n";
}   

int main() {
    IOS; 
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    
    ll no_of_test_cases; cin>>no_of_test_cases; 
    //ll no_of_test_cases = 1;
    //cout<<fixed<<setprecision(10);
    
    for(ll i=1; i<=no_of_test_cases; i++) {
        solve();
    } 
    return 0; 
}