Комбинации девочек и мальчиков

N = int(input())
M = int(input())
a = ['B', 'G']
 
m, n = (N < M), (N >= M)
i, j = max(M,N), min(M,N)
print(''.join((a[m], a[n], (a[m] * 2+ a[n])*(i-j-1), 
              (a[m] + a[n])*(2*j - i - j//i), a[m]*(j % i // j)))
      if 1 <= i / j <= 2 else 'NO SOLUTION')

print(''.join((a[m], a[n], (a[m] * 2+ a[n])*(i-j-1),
              (a[m] + a[n])*(2*j - i - j//i), a[m]*(j % i // j)))
      if i // j <= 2 else 'NO SOLUTION')

#!/usr/bin/python
# -*- coding: UTF-8 -*-
 
def bg_line(boys, girls):
    maxs = max(boys,girls)
    mins = min(boys,girls)
    if (1.0 * maxs / mins > 2):
        result_line = 'NO SOLUTION'
    else:
        maxi, mini = 'B', 'G'
        if maxs == girls:
            maxi, mini = 'G', 'B'
        unpairs = list(maxi*(maxs - mins))
        mx_list = list(maxi*mins)
        mi_list = list(mini*mins)
        result_line = []
        for i in range(mins):
            result_line.append(mx_list.pop())
            result_line.append(mi_list.pop())
            if len(unpairs): 
                result_line.append(unpairs.pop())
        result_line = ''.join(result_line)
    return result_line
 
if __name__ == '__main__':
    boys = raw_input()
    girls = raw_input()
    print bg_line(int(boys), int(girls))