CF551B.ZgukistringZ

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?

GukiZ 教授不接受字符串的原始形态。他喜欢通过交换字符串中的一些字符来得到一个新的字符串。

GukiZ 拥有三个字符串：a、b 和 c。他希望通过交换字符串 a 中的一些字符，得到字符串 k，使得 k 中包含尽可能多的互不重叠的子串，且每个子串都恰好等于 b 或 c。字符串 x 的子串是指由 x 中连续的一段字符构成的字符串。字符串 x 的两个子串若在 x 中存在某个位置 i 同时被二者占据，则称它们重叠。

GukiZ 非常失望，因为他的学生们无一能解出这道题。你能帮他们找到一个满足条件的可能的字符串 k 吗？

The first line contains string a, the second line contains string b, and the third line contains string c (1 ≤ |a|, |b|, |c| ≤ 105, 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$，第二行包含字符串 $b$，第三行包含字符串 $c$（$1 ≤ |a|, |b|, |c| ≤ 10^5$，其中 $|s|$ 表示字符串 $s$ 的长度）。

所有三个字符串仅由小写英文字母组成。

字符串 $b$ 和 $c$ 可能相同。

Find one of possible strings k, as described in the problem statement. If there are multiple possible answers, print any of them.

找出问题描述中所述的一个可能的字符串 $k$。如果存在多个可能的答案，输出其中任意一个即可。

In the third sample, this optimal solutions has three non-overlaping substrings equal to either b or c on positions 1 – 2 (ab), 3 – 4 (ab), 5 – 7 (aca). In this sample, there exist many other optimal solutions, one of them would be acaababbcc.

在第三个样例中，该最优解包含三个互不重叠的子串，它们分别等于 b 或 c，对应的位置为 1 – 2（ab）、3 – 4（ab）、5 – 7（aca）。在本样例中，存在许多其他最优解，其中之一为 acaababbcc。