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
import io

def div(a, b):
    result = 10000000
    for k, v in b.items():
        result = min(result, a[k] // v)
    return result

a = input()
b = input()
c = input()
ac = Counter(a)
bc = Counter(b)
cc = Counter(c)
best = 0
best_ij = (None, None)
for i in range(div(ac, bc) + 1):
    j = div(ac, cc)
    if i + j > best:
        best_ij = (i, j)
        best = i + j
    for k in bc:
        ac[k] -= bc[k]
ac = Counter(a)
for k in bc:
    ac[k] -= best_ij[0] * bc[k]
for k in cc:
    ac[k] -= best_ij[1] * cc[k]
s = io.StringIO()
s.write(best_ij[0] * b)
s.write(best_ij[1] * c)
for k, v in ac.items():
    s.write(k * v)
print(best_ij)
print(s.getvalue())
