ZOJ Problem Set - 2666
Young cryptoanalyst Georgie is investigating different schemes of generating random integer numbers ranging from 0 to m - 1. He thinks that standard random number generators are not good enough, so he has invented his own scheme that is intended to bring more randomness into the generated numbers.
First, Georgie chooses n and generates n random integer numbers ranging from 0 to m - 1. Let the numbers generated be a1 , a2 , . . . , an . After that Georgie calculates the sums of all pairs of adjacent numbers, and replaces the initial array with the array of sums, thus getting n - 1 numbers: a1 + a2 , a2 + a3 , . . . , an-1 + an . Then he applies the same procedure to the new array, getting n - 2 numbers. The procedure is repeated until only one number is left. This number is then taken modulo m --- it is the result of the generating procedure.
Georgie has proudly presented this scheme to his computer science teacher, but was pointed out that the scheme has many drawbacks. One important drawback is the fact that the result of the procedure sometimes does not even depend on some of the initially generated numbers. For example, if n = 3 and m = 2, then the result does not depend on a2 .
Now Georgie wants to investigate this phenomenon. He calls the i-th element of the initial array irrelevant if the result of the generating procedure does not depend on ai . He considers various n and m and wonders which elements are irrelevant for these parameters. Help him to find it out.
There are several test cases in the input. Each case contains n and m (1 ≤ n ≤ 100 000, 2 ≤ m ≤ 109 ).
On the first line of the output file print the number of irrelevant elements of the initial array for given n and m. On the second line print all such i that i-th element is irrelevant, or leave a blank line if there are no such irrelevant elements. Numbers on the second line must be printed in the ascending order.
Source: Northeastern Europe 2004