Problem Statement

Given are positive integers $a, b$, where none of the digits is $0$.

Permute the digits of each of $a$ and $b$ so that the sum of the digits in $a+b$ is minimized.

Constraints

• $1\leq a, b< 10^{100000}$
• None of the digits of $a$ and $b$ is $0$.

Input

Input is given from Standard Input in the following format:

a
b

Output

After permuting the digits of each of $a$ and $b$ so that the sum of the digits in $a+b$ is minimized, print $a$ in the first line and $b$ in the second line.

If multiple solutions exist, printing any of them will be accepted.