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.
from collections import Counter
from collections import defaultdict

def get_count(a, b, c):
	r1, r2 = 0, 0
	while (a & b == b):
		a = a - b
		r1 += 1

	while (a & c == c):
		a = a - c
		r2 += 1

	return r1, r2

a = input()
b = input()
c = input()
aa = Counter(a)
bb = Counter(b)
cc = Counter(c)

r1 = get_count(Counter(a), bb, cc)
r2 = get_count(Counter(a), cc, bb)
r = r1 if sum(r1) > sum(r2) else r2[1], r2[0]

res = r[0] * b + r[1] * c
rest = aa - Counter(res)
res += ''.join(list(rest.elements()))

print(res)
