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.
import java.math.BigInteger;
import java.util.*;
import java.io.*;

public class A_Boys_and_Girls {
    public static void main (String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new FileReader("input.txt"));
        PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
        String st[]=br.readLine().split(" ");
        int n=Integer.parseInt(st[0]);
        int m=Integer.parseInt(st[1]);
        if (n > m) {
            boolean boy = true;
            while (n > 0 && m > 0) {
                if (boy) {
                    pw.print('B');
                    boy = false;
                    n--;
                }
                else {
                    pw.print('G');
                    boy = true;
                    m--;
                }
            }
            while (n-- > 0) {
                pw.print('B');
            }
            while (m-- > 0) {
                pw.print('G');
            }
        }
        else {
            boolean girl = true;
            while (n > 0 && m > 0) {
                if (girl) {
                    pw.print('G');
                    girl = false;
                    m--;
                }
                else {
                    pw.print('B');
                    girl = true;
                    n--;
                }
            }
            while (n-- > 0) {
                pw.print('B');
            }
            while (m-- > 0) {
                pw.print('G');
            }
        }
        pw.println();
        br.close();
        pw.close();
    }
    public static void inputArray (int[] arr, int n, FastReader scan) {
        for (int i=0; i<n; i++) {
            arr[i] = scan.nextInt();
        }
    }
    public static void printArray (int[] arr) {
        for (int i=0; i<arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }
    public static boolean isPrime (int n) {
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;
        if (n % 2 == 0 || n % 3 == 0)
            return false;
        for (int i = 5; i * i <= n; i = i + 6)
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        return true;
    }
    public static int gcd (int a, int b) {
        BigInteger a1 = BigInteger.valueOf(a);
        BigInteger b1 = BigInteger.valueOf(b);
        return a1.gcd(b1).intValue();
    }
    public static int numberOfDigitsInNumber (int n) {
        return (int)Math.floor(Math.log10(n)) + 1;
    }
    public static boolean isPowerOfTwo (int x) {
        return x!=0 && ((x&(x-1)) == 0);   
    }
    public static String toBinaryString (int n) {
        return Integer.toString(n, 2);
        // for other bases change 2 to other bases
    }
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(
                new InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt() { return Integer.parseInt(next()); }
 
        long nextLong() { return Long.parseLong(next()); }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}