Strange Joseph and The Knights of Round Table
N people are sitting at the round table. Each participant gets a number which begins from 1. Two neighbors have the serial numbers except first and last one. Joseph is calling two positive integers X and Y (X < Y). The circle is dividing into two circles. All the participants with the number from X+1 till Y-1 are sitting at new round table. The participant with numbers from Y+1 till N and from 1 till X-1 are sitting in another round table. The participants with the numbers X+1 and Y+1 are getting new number 1. According to that all the participants in the new circle are getting new numbers.
If it stays only one participant at the table he becomes a spectator and the table leave the game. If there is 0 of participants then the table just leaves the game.
Joseph continue to call two positive numbers the same action is happen for all tables. He continue the game until it stays the tables where it is at less two participants.
Joseph is asking you to find out how many spectators who was participant at beginning will be in the end, and return their numbers in a start numbering.
Input
Three positive integers: N – the initial number of people (4 ≤ N ≤ 10^5), and X, Y – numbers, mentioned by Joseph.(1 ≤ X < Y ≤ 10^9).
Output
First line will contain one number – the number of people who was taking part in a game and became a spectators. In next line initial numbers of spectators. In ascending order. If there isn’t players who transfer to spectator – print single line with "0" (without brackets).