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 < 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.

Difficulty: EASY

Solutions:
import sys, os, io, time, copy, math
from functools import lru_cache
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

def main():
	(n, m) = map(int, input().split())
	if n < m:
		for i in range(n):
			print('GB', end='')
		for i in range(m - n):
			print('G', end='')
		print('')
	elif n > m:
		for i in range(m):
			print('BG', end='')
		for i in range(n - m):
			print('B', end='')
		print('')
	else:
		for i in range(n):
			print('GB', end='')
		print('')
main()