Cemetery#180
After each major battle, the orc general, Grom Hellscream, feels it is his duty to visit the cemetery to honor the fallen orcs. He walks around all the graves, beginning his journey at his father's grave and concluding at his mother's grave.
The graves are arranged in a single row, numbered from to . Grom can move between graves with a step size that allows him to move to a grave whose number is at most away from his current position. He must stay within the cemetery's boundaries and cannot revisit any grave during his round.
Your task is to write a program that helps Grom complete his round of all the graves while following these rules.
The input consists of a single line with three integers: the total number of graves , and the numbers of Grom's father's and mother's graves and . (2 \leq N \leq 10000, 1 \leq A, B \leq N, A \neq B).
The output should be a sequence of N-1 steps, each formatted as [sign][number], where [sign] is either + or − indicating the direction of the step, and [number] is or indicating the step size. If it is impossible to complete the round, output the number .
Example 1