Halloween treats（https://acs.jxnu.edu.cn/problem/HDU1808）

描述：

Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so it may happen that a child will get nothing if it is too late. To avoid conflicts, the children have decided they will put all sweets together and then divide them evenly among themselves. From last year's experience of Halloween they know how many sweets they get from each neighbour. Since they care more about justice than about the number of sweets they get, they want to select a subset of the neighbours to visit, so that in sharing every child receives the same number of sweets. They will not be satisfied if they have any sweets left which cannot be divided.

Your job is to help the children and present a solution.
 

输入：

The input contains several test cases.
The first line of each test case contains two integers c and n (1 ≤ c ≤ n ≤ 100000), the number of children and the number of neighbours, respectively. The next line contains n space separated integers a1 , ... , an (1 ≤ ai ≤ 100000 ), where ai represents the number of sweets the children get if they visit neighbour i.

The last test case is followed by two zeros.
 

输出：

For each test case output one line with the indices of the neighbours the children should select (here, index i corresponds to neighbour i who gives a total number of ai sweets). If there is no solution where each child gets at least one sweet, print "no sweets" instead. Note that if there are several solutions where each child gets at least one sweet, you may print any of them.

翻译：在每年的万圣节会遇到相同的问题，不过多少个孩子前来，邻居在这天只愿意给确定数量的糖果，这导致了部分晚来的孩子没糖吃.为了避免这个问题，孩子们决定将糖果收集并平均分配.从去年的经历来看，他们了解从每个邻居家可以获得的糖果的数量.孩子们更看重正义而不是个人获得糖果的多少，于是他们想要拜访一部分邻居，以保证孩子们都能得到相同数量的糖果.当糖果无法均分时，他们就不感到满意.大神，救救孩子吧.

输入：输入一些测试样例.在每个测试样例第一行有两个整数c和n（1<=c<=n<=100000）c为孩子数量，n为邻居数量.下一行有n个数字a1，a2，，，an（分隔一空格）.ai代表着邻居i能够给出的糖果数量.最后一个测试样例为两个0.

输出：对于每个测试样例，在一行上输出孩子们应该拜访的邻居（这里i代表能给出ai个糖果的邻居）.如果无法满足每个学生至少一个糖果，打印“no sweets”否则，表示出该方案，你可以打印出所有方案中的任一个.