#include <bits/stdc++.h>

using namespace std;

#define x first
#define y second
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int N = 200010;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;

int n, m;
LL s[N];
PLL a[N];

void solve() {
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i].x, a[i].y = i;
	sort(a + 1, a + n + 1);
	for(int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i].x;

	for(int i = n; i >= 1; i--)
		if(a[i].x > s[i - 1]){
			m = i;
			break;
		}
	
	vector<int> ans;
	for(int i = m; i <= n; i++) ans.push_back(a[i].y);
	sort(ans.begin(), ans.end());
	
	cout << ans.size() << endl;
	for(int i = 0; i < ans.size(); i++) cout << ans[i] << ' ';
	cout << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T = 1;
    cin >> T;
    while (T--) solve();

    return 0;
}
