Boys and Girls

题意翻译

班上有 $n$ 名男生和 $m$ 名女生在学习。他们要站成一列,以便男孩和女孩交替出现。假设队列中同学的编号为 $1 \sim n+m$,那么我们要尽量让第 $i$ 名同学和第 $i+1$ 名同学性别不同(即第 $i$ 名为男生,$i+1$ 名为女生,反之亦可),也就是说我们要让这种情况出现次数最多。 救救孩子!告诉他们该如何站成一列! 注意这道题有毒,要开文件,分别是:`input.txt` 和 `output.txt`

题目描述

There 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&lt;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.

输入输出格式

输入格式


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

输出格式


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.

输入输出样例

输入样例 #1

3 3

输出样例 #1

GBGBGB

输入样例 #2

4 2

输出样例 #2

BGBGBB

说明

In the first sample another possible answer is BGBGBG. In the second sample answer BBGBGB is also optimal.