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()
a, b, c = list(a), list(b), list(c)
a.append("")
extra = a
def swap(x, y):
    glass = a[x]
    a[x] = a[y]
    a[y] = glass
k = []
count = 0
output = ""
while count <= len(a):
    for letter in b:
        for element in a:
            if letter == element:
                k.append(letter)
                a.remove(letter)
                count += 1
                break
    for letter in c:
        for element in a:
            if letter == element:
                k.append(letter)
                a.remove(letter)
                count += 1
                break
for X in extra:
    if X not in k:
        k.append(X)
        
for element in k:
    output += element
print (output)
