Rating changes for the last round are temporarily rolled back. They will be returned soon.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Boys and Girls

time limit per test

1 secondmemory limit per test

256 megabytesinput

input.txtoutput

output.txtThere are *n* boys and *m* girls studying in the class. They should stand in a line so that boys and girls alternated there as much as possible. Let's assume that positions in the line are indexed from left to right by numbers from 1 to *n* + *m*. Then the number of integers *i* (1 ≤ *i* < *n* + *m*) such that positions with indexes *i* and *i* + 1 contain children of different genders (position *i* has a girl and position *i* + 1 has a boy or vice versa) must be as large as possible.

Help the children and tell them how to form the line.

Input

The single line of the input contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 100), separated by a space.

Output

Print a line of *n* + *m* characters. Print on the *i*-th position of the line character "B", if the *i*-th position of your arrangement should have a boy and "G", if it should have a girl.

Of course, the number of characters "B" should equal *n* and the number of characters "G" should equal *m*. If there are multiple optimal solutions, print any of them.

Examples

Input

3 3

Output

GBGBGB

Input

4 2

Output

BGBGBB

Note

In the first sample another possible answer is BGBGBG.

In the second sample answer BBGBGB is also optimal.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/28/2020 22:07:59 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|