#include<bits/stdc++.h>
using namespace std;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define fr(i,k) for(i=0;i<k;i++)
#define deb(x) cerr<<#x<<"  = "<<x<<endl;
#define deb2(x,y) cerr<<#x<<" ="<<x<<endl<<#y<<" ="<<y<<endl;
#define SZ(x) (x).size();
#define ll long long
#define mod 1000000007
#define ff first
#define ss second
#define pb push_back
#define em emplace_back
#define ulli unsigned long long int
#define inf 1e18
//#define endl "\n"
typedef vector<vector<ll>> vvll;
typedef vector<ll> vll;
typedef vector<pair<ll,ll>> vpll;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
void solve();


int main() {
	fastio;

	ll t;
	t = 1;

	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}

inline void solve()
{
	ll n, i,j,k;
	cin>>n;

	vpll v(n);
	vll pre(n);
	vll ans;

	for(i=0;i<n;i++)
    {
        cin>>v[i].first;
        v[i].second=i+1;
    }

    sort(v.begin(),v.end());

    pre[0]=v[0].first;

    for(i=1;i<n;i++)
        pre[i]=pre[i-1]+v[i].first;

    ans.pb(v[n-1].second);
    for(i=n-2;i>=0;i--)
    {
        if(pre[i]>=v[i+1].first && ans.back() == v[i+1].second)
        {
            ans.pb(v[i].second);
        }
    }

    sort(ans.begin(),ans.end());
    cout<<ans.size()<<endl;
    for(auto k:ans)
        cout<<k<<" ";

    cout<<endl;

}
