Bob found a nice task in his old math book for children. It says:
There are children standing in a circle, of them stand next to a boy, and of them stand next to a girl. How is it possible?
Here is the solution to the task. If boys and girls stand like this: BGBGBGBGGG, there are children who stand next to a boy (BGBGBGBGGG), and children who stand next to a girl (BGBGBGBGGG).
Now Bob wants to solve a generalized version of this task:
There are children standing in a circle, of them stand next to a boy, and of them standnext to a girl. How is it possible?
Help Bob by writing a program that solves the generalized task.
The single line contains three integers , and (2 \le n \le 100\,000; 0 \le x, y \le n).
If there is a solution, output a string of length , describing the order of children in the circle. Character G corresponds to a girl, character B corresponds to a boy. If there are several solutions, output any of them.
If there is no solution, output "Impossible".
Example 1
Example 2