1490E - Accidental Victory - CodeForces Solution

def main():
    alpha = 'abcdefghijklmnopqrstuvwxyz'
    ALPHA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
    inf = 1e17
        mod = 10 ** 9 + 7

                                                                                    




    def factorial(n):
        f = 1

        for i in range(1, n + 1):
            f = (f * i) % mod          
        return f

    def factorial_by(n, by):
        f = 1

        for i in range(1, n + 1):
            if i == by:
                continue
            f = (f * i) % mod          
        return f

    def ncr(n, r):
                        num = den = 1
        for i in range(r):
            num = (num * (n - i)) % mod
            den = (den * (i + 1)) % mod
        return (num * pow(den,
                          mod - 2, mod)) % mod

    def primeFactors(num):

        pf = []
        while num % 2 == 0:
            pf.append(2)
            num = num // 2

                        for i in range(3, int(math.sqrt(num)) + 1, 2):

                        while num % i == 0:
                pf.append(i)
                num = num // i

                        if num > 2:
            pf.append(num)

        return pf

    class Node(object):
        def __init__(self, anc, s):
            self.anc = anc
            self.s = s

        def __repr__(self):
            return str(self.s)
            pass

    class DSU:
        def __init__(self, n):
            self.parent = list(range(n))
            self.size = [1] * n
            self.num_sets = n

        def find(self, a):
            acopy = a
            while a != self.parent[a]:
                a = self.parent[a]
            while acopy != a:
                self.parent[acopy], acopy = a, self.parent[acopy]
            return a

        def union(self, a, b):
            a, b = self.find(a), self.find(b)
            if a != b:
                if self.size[a] < self.size[b]:
                    a, b = b, a

                self.num_sets -= 1
                self.parent[b] = a
                self.size[a] += self.size[b]


    def floor(a,b):
        val = a//b
        while val*b > a:
            val -= 1
        return val

    def isprime(num):
        for _ in range(2, int(math.sqrt(num)) + 1):
            if num % _ == 0:
                return False
        return True




    def solve(n,a):

        arr_ind = []
        for i in range(n):
            arr_ind.append((a[i],i+1))
        arr_ind.sort()

        pre = [0]

        for i in range(n):
            pre.append(pre[-1]+arr_ind[i][0])

                winners = [arr_ind[n-1][1]]
        for i in range(n-1,0,-1):
            if pre[i] >= arr_ind[i][0]:
                winners.append(arr_ind[i-1][1])
            else:
                break
            
        return str(len(winners))+"\n" +" ".join(list(map(str,sorted(winners))))



































    
    t = int(input())
    ans = []
    for _ in range(t):
        
        n = int(input())

                
        
        a = [int(x) for x in input().split()]
        
                                        
                                                                        

        ans.append(solve(n,a))

    p = 1
    for answer in ans:
        #        print(answer)
        p += 1


if __name__ == "__main__":
    import sys, threading
    import bisect
    import math
    import itertools
    from sys import stdout
    from collections import defaultdict,deque
    from heapq import heappush, heappop


        import heapq
    from queue import PriorityQueue


            
    input = sys.stdin.readline
    thread = threading.Thread(target=main)
    thread.start()
    thread.join()