You are given a multiset of N integers. Please find such a nonempty subset of it that the sum of the subset's elements is divisible by N. Otherwise, state that this subset doesn't exist.

Input

The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. 
The first line of each test consists of a single integer N - the size of the multiset.
The second line of each test contains N single space separated integers - the multiset's elements.

Output
For each test case output:

-1 if the required subset doesn't exist
If the required subset exists, output two lines. Output the size of the subset on the first line and output the list of indices of the multiset's element that form the required subset. Of course, any number can be taken in the subset no more than once.

If there are several such subsets, you can output any.

Constraints

1 <= The sum of N over all the test cases <= 10^5
Each element of the multiset is a positive integer, not exceeding 10^9.
1 <= N <= 15 : 37 points. 
1 <= N <= 1000 : 24 points.
1 <= N <= 10^5 : 39 points. 


Example
Input:
1
3
4 6 10

Output:
1
2


Explanation
We can pick {6} as the subset, then its sum is 6 and this is divisible by 3 - the size of the initial multiset.
import fileinput
import itertools
import sys
import random

''' http://www.codechef.com/problems/DIVSUBS '''

def single_test_dumb(nums):
	nums = [(index, int(x)) for index,x in enumerate(fi.readline().strip().split(" "))]

	for i in range(1, len(nums)+1):
		for pairs in itertools.combinations(nums, i):
			if sum(x[1] for x in pairs) % n == 0:
				print len(pairs)
				print ' '.join(str(x[0]+1) for x in pairs)
				return

def single_test_smart(nums):
	n = len(nums)

	sums = [nums[0][1]]
	for idx in range(1, n):
		sums.append((sums[idx-1] + nums[idx][1]))

	sums = [x % n for x in sums]

	rems = {}
	for index, x in enumerate(sums):
		if x == 0:
			print index+1
			print ' '.join(str(x+1) for x in range(index+1))
			return

		if x in rems:
			#assert((sum(x[1] for x in nums[rems[x]+1:index+1]) % n) == 0)
			#print sum(x[1] for x in nums[rems[x]+1:index+1]) % n, sum(x[1] for x in nums[rems[x]+1:index+1])
			#print nums[rems[x]+1:index+1]
			print index - rems[x]
			print ' '.join(str(x+1) for x in range(rems[x]+1, index+1))
			return
		rems[x] = index
	print -1

def main():
	if len(sys.argv) > 1:
		togen = int(sys.argv[1])
		print 1
		print togen
		print ' '.join(str(random.randint(1, 10**9)) for x in range(togen))
		return

	fi = fileinput.input()
	numtests = int(fi.readline())

	for i in range(numtests):
		n = int(fi.readline())
		nums = [(index, int(x)) for index,x in enumerate(fi.readline().strip().split(" "))]
		single_test_smart(nums)


if __name__ == '__main__':
	main()