{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eEvery 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\u0027s 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.\u003c/p\u003e\u003cp\u003eYour job is to help the children and present a solution.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe input contains several test cases.\u003cbr\u003eThe first line of each test case contains two integers \u003cstrong\u003e\u003ci\u003ec\u003c/i\u003e\u003c/strong\u003e and \u003cstrong\u003e\u003ci\u003en\u003c/i\u003e\u003c/strong\u003e (\u003ci\u003e1 ≤ c ≤ n ≤ 100000\u003c/i\u003e), the number of children and the number of neighbours, respectively. The next line contains \u003cstrong\u003e\u003ci\u003en\u003c/i\u003e\u003c/strong\u003e space separated integers \u003cstrong\u003e\u003ci\u003ea\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e , ... , \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003en\u003c/i\u003e\u003c/sub\u003e\u003c/strong\u003e (\u003ci\u003e1 ≤ a\u003csub\u003ei\u003c/sub\u003e ≤ 100000 \u003c/i\u003e), where \u003cstrong\u003e\u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003ei\u003c/i\u003e\u003c/sub\u003e\u003c/strong\u003e represents the number of sweets the children get if they visit neighbour \u003cstrong\u003e\u003ci\u003ei\u003c/i\u003e\u003c/strong\u003e.\u003c/p\u003e\u003cp\u003eThe last test case is followed by two zeros.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case output one line with the indices of the neighbours the children should select (here, index \u003cstrong\u003e\u003ci\u003ei\u003c/i\u003e\u003c/strong\u003e corresponds to neighbour \u003cstrong\u003e\u003ci\u003ei\u003c/i\u003e\u003c/strong\u003e who gives a total number of \u003cstrong\u003e\u003ci\u003ea\u003c/i\u003e\u003csub\u003ei\u003c/sub\u003e\u003c/strong\u003e 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.\u003c/p\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4 5\r\n1 2 3 7 5\r\n3 6\r\n7 11 2 5 13 17\r\n0 0\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3 5\r\n2 3 4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}