#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
typedef long long LL;
//#define int long long
struct NODE {
    int id, val;
    bool operator < (const NODE& x) const {
        return val < x.val;
    }
}node[N];
long long pre[N];
void solve() {
    int n; cin >> n;
    for (int i = 0; i <= n + 1; ++i)pre[i] = 0;
    for (int i = 1; i <= n; ++i) {
        int w; cin >> w;
        node[i] = {i, w};
    }
    sort (node + 1, node + 1 + n);
    for (int i = 1; i <= n; ++i) {
        pre[i] = pre[i - 1] + node[i].val;
    }
    int idx = 0;
    for (int i = n - 1; i >= 1; --i) {
        if (node[i + 1].val > pre[i]) {
            idx = i;break;
        }
    }
    vector<int>ans;
    for (int i = idx + 1; i <= n; ++i) ans.push_back(node[i].id);
    sort(ans.begin(), ans.end());
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); ++i) {
        cout << ans[i] << " ";
    }
    cout << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
}

