#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn = 2e5+10;
const int mod = 1e9+7;
typedef pair<int,int> pii;

void solve()
{
    int n;cin >> n;
    vector<int>a(n);
    for(int i = 0;i<n;i++)cin >> a[i];
    vector<int>b = a;
    sort(a.begin(),a.end());
    int st = a[0];
    ll sum = 0;
    for(int i = 0;i<n;i++){
        if(a[i] <=sum)sum+=a[i];
        else sum+=a[i],st = a[i];
    }
    vector<int>ans;
    for(int i = 0;i<n;i++){
        if(b[i] >=st)ans.push_back(i+1);
    }
    cout << ans.size() << endl;
    for(auto v: ans)cout << v << " ";
    cout << endl;
}
int main(){
    int T = 1;for(cin >> T;T;T--)solve();
    // system("pause");
}