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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.InputStream;

import java.util.ArrayList;
import java.util.Arrays;

import java.util.Comparator;


public class Solution {
//    ----------------------------------------------------------------------------

    static class Task {

        public void solve(int testNumber, InputReader in, PrintWriter out) throws IOException {

            int b = in.nextInt();
            int g = in.nextInt();

            if (b == g) {

                for (int i = 0; i < b; i++) {

                    out.print("BG");

                }

            } else if (b > g) {

                for (int i = 0; i < b; i++) {

                    if (g > 0) {
                        out.print("BG");
                        g--;
                    } else {
                        out.print("B");
                    }

                }

            } else {

                for (int i = 0; i < g; i++) {

                    if (b > 0) {
                        out.print("GB");
                        b--;
                    } else {
                        out.print("G");
                    }

                }

            }

            out.close();
        }
    }
//    ----------------------------------------------------------------------------
    // IMPORTANT || COMMON  METHODS
    // PAIR

    static class Pair {

        int x;
        int y;

        // Constructor 
        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        // how to initialize
//            Pair level[] = new Pair[n];
//            for (int i = 0; i < n; i++) {
//                int x = in.nextInt();
//                int y = in.nextInt();
//
//                level[i] = new Pair(x, y);
//
//            }
        // How to sort
//              PairSort ps = new PairSort();
//              ps.sort(level, 1);
    }

    static class PairSort {

        Pair[] sort(Pair arr[], int i) {
            // Comparator to sort the pair according to second element 
            Arrays.sort(arr, new Comparator<Pair>() {
                @Override
                public int compare(Pair p1, Pair p2) {
                    // 1 sees the first elements ans sorts them in increasing order 
                    // 2 sees the second elements ans sorts them in increasing order 
                    // 3 sees the first elements ans sorts them in decreasing order 
                    // 4 sees the second elements ans sorts them in decreasing order 
                    switch (i) {
                        case 2:
                            return p1.y - p2.y;
                        case 1:
                            return p1.x - p2.x;
                        case 4:
                            return p2.y - p1.y;
                        default:
                            return p2.x - p1.x;
                    }

                }
            });

            return arr;
        }
    }

    // GCD || HCF
    static long GCD(long x, long y) {
        return y == 0 ? x : GCD(y, x % y);
    }

    // LCM 
    static long LCM(long a, long b) {
        return (a * b) / GCD(a, b);
    }

    // Returns the divisors of a number
    static ArrayList Divisors(long n) {
        ArrayList<Long> div = new ArrayList<>();

        for (long i = 1; i <= Math.sqrt(n); i++) {
            if (n % i == 0) {
                div.add(i);

                if (n / i != i) {
                    div.add(n / i);
                }
            }
        }
        return div;
    }

    // PERMUTATIONS
    static void permute(int[] a, int k) {
        if (k == a.length) {

            for (int i = 0; i < k; i++) {

                System.out.print(a[i] + " ");

            }

            System.out.println("");
        } else {
            for (int i = k; i < a.length; i++) {
                int temp = a[k];
                a[k] = a[i];
                a[i] = temp;

                permute(a, k + 1);
                // swapping a[k] and a[i] .
                temp = a[k];
                a[k] = a[i];
                a[i] = temp;
            }
        }

        // How to run 
        //int seq[] = {1, 19, 6}; .. let seq be the array of numbers to be permuted
        //permute(seq, 0); // call this function . 
        //0 -> all permutations ( permutation start from 1st number) 
        //1-> permutations start from 2nd number 
        //2-> permutation start from 3rd number
        // n-1 that array will be returned
    }
//    ----------------------------------------------------------------------------
    // MAIN - INPUT - OUTPUT 

    public static void main(String[] args) throws IOException {

        File file = new File("input.txt");

        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(new FileInputStream(file));
        //InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(new FileOutputStream("output.txt"));
        // PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }

    static class InputReader {

        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public Double nextDouble() {
            return Double.parseDouble(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public int[] nextIntArray(int arraySize) {
            int array[] = new int[arraySize];

            for (int i = 0; i < arraySize; i++) {
                array[i] = nextInt();
            }

            return array;
        }

    }
}

// to take the string as a single character each . do this.

/*          BufferedReader inn = new BufferedReader(new InputStreamReader(System.in));
            char[] s1 = inn.readLine().toCharArray();
            // for going through each ch in ch array
            for (char c : s1) {
                if (c != ' ') {

                }

            }
 */