Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtain a new one.

GukiZ has strings *a*, *b*, and *c*. He wants to obtain string *k* by swapping some letters in *a*, so that *k* should contain as many non-overlapping substrings equal either to *b* or *c* as possible. Substring of string *x* is a string formed by consecutive segment of characters from *x*. Two substrings of string *x* overlap if there is position *i* in string *x* occupied by both of them.

GukiZ was disappointed because none of his students managed to solve the problem. Can you help them and find one of possible strings *k*?
The first line contains string *a*, the second line contains string *b*, and the third line contains string *c* (1 ≤ |*a*|, |*b*|, |*c*| ≤ 10<sup class="upper-index">5</sup>, where |*s*| denotes the length of string *s*).

All three strings consist only of lowercase English letters. 

It is possible that *b* and *c* coincide.
a = input()
b = input()
c = input()

all_set = set(a + b + c)

def getMin(object_dict, sub_dict):
	return min([object_dict[ch] // sub_dict[ch] for ch in sub_dict.keys() if sub_dict[ch] > 0])

a_dict = {ch : a.count(ch) for ch in all_set}
b_dict = {ch : b.count(ch) for ch in all_set}
c_dict = {ch : c.count(ch) for ch in all_set}

bMin = getMin(a_dict, b_dict)
bsum = 0
csum = 0
for i in range(bMin + 1):
	j = min((a_dict[ch] - b_dict[ch] * i) // c_dict[ch] for ch in all_set if c_dict[ch] > 0)
	if i + j > bsum + csum:
		bsum, csum = i, j
print(b * bsum, end = "")
print(c * csum, end = "")

for ch in all_set:
	print(ch * (a_dict[ch] - b_dict[ch] * bsum - c_dict[ch] * csum), end = '')
print()