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.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;


public class Main {
    
	public static void main( String[] args ) throws FileNotFoundException {
    	new CF().doit();
    }
}

class CF {
	InputReader ir;
	PrintStream ps;
	public void doit() throws FileNotFoundException {
//		ir = new InputReader( System.in );
		ir = new InputReader( new FileInputStream("input.txt") );
		ps = new PrintStream(new FileOutputStream("output.txt"));
//		ps = System.out;
		int n = ir.nextInt();
		int m = ir.nextInt();
		if( n < m ) {
			ps.print("G");
			m--;
		}
		while( n > 0 || m > 0 ) {
			if( n > 0 ) {
				ps.print("B");
				n--;
			}
			if( m > 0 ) {
				ps.print("G");
				m--;
			}
		}
	}
}

class InputReader {
	private BufferedReader reader;
	private StringTokenizer tokenizer;
	
	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream));
		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 long nextLong() {
		return Long.parseLong( next() );
	}
	public double nextDouble() {
		return Double.parseDouble( next() );
	}
}

class CucumberMarket
{
	public long countColors(String[] clipboard, int T)
	{
		long ans = 0;
		int add = 0;
		int row = clipboard.length;
		int col = clipboard[0].length();
		boolean[][] vist = new boolean[row][col];
		for(int i = 0; i < col; i++ ) {
			if( clipboard[row-1].charAt(i) == 'B' ) {
				add++;
				vist[row-1][i] = true;
			} else {
				int ii = i;
				for(int j = row-1; ii>= 0 && j >= 0; j--,ii-- ) if(clipboard[j].charAt(ii) == 'B') {
					add++;
					vist[j][ii] = true;
					break;
				}
			}
		}
		for( int i = 0; i < row; i++ ) if(!vist[i][col-1]) {
			if(clipboard[i].charAt(col-1) == 'B') {
				add++;
				vist[i][col-1] = true;
			} else {
				int ii = i;
				for( int j = col-1; ii >= 0 && j >= 0; ii--,j-- ) if(clipboard[ii].charAt(j) == 'B') {
					if(vist[ii][j]) break;
					add++;
					vist[ii][j] = true;
					break;
				}
			}
		}
		ans += ((long)T) * add;
		
		for( int i = 0; i < row; i++ ) {
			for( int j = 0; j < col; j++ ) if(clipboard[i].charAt(j) == 'B' && !vist[i][j]) {
				int a = 1;
				for(int ii = i+1, jj = j+1; ii < row && jj < col; ii++,jj++) {
					if(clipboard[ii].charAt(jj) != 'B') {
						a++;
					} else break;
				}
				ans += Math.min(a, T);
			}
		}
		return ans;
	}
}

class Scan {
	InputStream inp;
	public Scan(InputStream in) {
		inp = in;
	}
	public String next() {
		StringBuffer res = new StringBuffer();
		try {
			int t = inp.read();
			while ( (t < 'a' || t > 'z') && (t < 'A' || t > 'Z') && ( t < '1' || t < '9') ) t = inp.read();
			while ( ('a' <= t && t <= 'z') || ('A' <= t && t <= 'Z') || ('1' <= t && t <= '9') ) {
				res.append( ((char)t) );
				t = inp.read();
			}
		} catch (IOException e) {
			e.printStackTrace();
		}
		return res.toString();
	}
	public int nextInt() {
		boolean isN = false;
		int res = 0;
		int t;
		try {
			t = inp.read();
			if (t == -1) return -1;
			while (t != -1 && t != '-' && (t > '9' || t < '0')) t = inp.read();
			if ( t == '-' ) {
				isN = true;
				t = inp.read();
			}
			while (t != -1 && t >= '0' && t <= '9') {
				res = res * 10 + (t - '0');
				t = inp.read();
			}
		} catch (IOException e) {
			e.printStackTrace();
		}
		if ( isN ) res = -res;
		return res;
	}
	public double nextDouble() {
		double res = 0, Dec = 0.1;
		boolean isN = false, isD = false;
    	int t;
    	try {
    		t = inp.read();
			if ( t == -1 ) return -1;
			while ( t != '-' && t != '.' && (t < '0' || t > '9') ) t = inp.read();
			if ( t == '-' ) {
				isN = true;
				res = 0;
			} else if ( t == '.' ) {
				isD = true;
				res = 0;
			} else res = (double) t - '0';
			if ( !isD ) {
				t = inp.read();
				while ( t >= '0' && t <= '9' ) {
					res = res * 10 + (t - '0');
					t = inp.read();
				}
			}
			if ( t != '.' ) {
				if ( isN ) res = -res;
				return res;
			} else {
				t = inp.read();
				while ( t >= '0' && t <= '9' ) {
					res += Dec * (t - '0');
					Dec *= 0.1;
					t= inp.read();
				}
			}
			if ( isN ) res = -res;
		} catch (IOException e) {
			e.printStackTrace();
		}
    	return res;
    }
}