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

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {
	public static void main(String[] args) throws IOException {
		Task task = new Task();
		task.getData();
		task.solve();
		task.printAnswer();
	}
}

class Task {
	int n, m;

	StringBuilder answer = new StringBuilder();

	public void getData() throws IOException {
		//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedReader br = new BufferedReader(new FileReader("input.txt"));
		
		String[] data = br.readLine().split(" ");
		n = Integer.parseInt(data[0]);
		m = Integer.parseInt(data[1]);
		
		br.close();
	}

	public void solve() {
		String dominant = (n > m ? "B" : "G");
		String recessive = (n > m ? "G" : "B");
		
		for (int i = 0; i < Math.min(n, m); ++i) {
			answer.append(dominant + recessive);
		}
		for (int i = 0; i < Math.max(n, m) - Math.min(n, m); ++i) {
			answer.append(dominant);
		}
	}

	public void printAnswer() throws IOException {
		//System.out.print(answer);
		FileWriter fw = new FileWriter(new File("output.txt"));
		BufferedWriter bw = new BufferedWriter(fw);
		bw.append(answer);
		bw.close();
	}
}

class Team {
	int solved;
	int totalTime;

	Team(int solved, int totalTime) {
		this.solved = solved;
		this.totalTime = totalTime;
	}

	int compareTo(Team two) {
		if (solved == two.solved && totalTime == two.totalTime) {
			return 0;
		}
		if (solved > two.solved || solved == two.solved
				&& totalTime < two.totalTime) {
			return -1;
		}

		return 1;
	}

	@Override
	public boolean equals(Object o) {
		return (o instanceof Team) && compareTo((Team) o) == 0;
	}
}