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.util.*;
import java.io.*;
import java.util.stream.Stream;
/**
 *
 * @author comp
 */
public class Olimp {
    
    /**
     * @param args the command line arguments
     * @throws java.io.IOException
     */
    public static void main(String[] args) throws IOException{
        //Scanner in = new Scanner(System.in);
        Scanner in = new Scanner(new File("input.txt"));
        PrintWriter out = new PrintWriter(new File("output.txt"));
        int n=in.nextInt();
        int m=in.nextInt();
        int n1=n, m1=m;
        char f[]=new char[n+m];
        if(n>m){
            for(int i=1; m>0; i+=2){
                f[i]='G';
                m--;
            }
            for (int i = 0; i < n1+m1; i++) {
                if(f[i]=='G')
                    out.print(f[i]);
                else out.print('B');
            }
            out.close();
            return;
        }
        else if(n<m){
            for(int i=1; n>0; i+=2){
                f[i]='B';
                n--;
            }
            for (int i = 0; i < n1+m1; i++) {
                if(f[i]=='B')
                    out.print(f[i]);
                else out.print('G');
            }
            out.close();
            return;
        }
        else if(n==m){
            for (int i = 0; i < n+m; i++) {
                if(i%2==0)
                    out.print('B');
                else out.print('G');
            }
            out.close();
            return;
        }
        
    }
    
}