Sequence
Given a set of N natural numbers a[1], a[2], ..., a[N], your task is to find a set of distinct indices b[1], b[2], ..., b[K] (1 ≤ K ≤ N) such that the sum a[b[1]] + a[b[2]] + ... + a[b[K]] is divisible by N without a remainder.
Input
The first line of the input contains the number of test cases m. For each test case, the first line contains the number of elements N (1 ≤ N ≤ 45).
The following N lines each contain one natural number from the sequence a[1], a[2], ..., a[N]. It is guaranteed that the sum of these numbers does not exceed the limits of standard integer types.
The input data is guaranteed to be correct.
Output
For each test case, output a single line containing the indices b[1], ..., b[K], separated by spaces, or the message "No solution" if no such set of indices exists.