Two Strings

The cyclic shift of a string $s_0s_1\ldots s_{n-1}$ by $k$ positions is the string $s_ks_{k+1}\ldots s_n s_1\ldots s_{k-1}$. For example, the cyclic shift of the string «abcde» by two positions is the string «cdeab». In this problem, from now on only strings consisting of the decimal digits 0 through 9 are considered. Any such string whose first character is not zero can be assigned the number whose decimal representation it is. No number is assigned to strings that begin with zero. For example, the string 123 is assigned the number one hundred twenty-three, and the string 0123 is assigned no number.

Two strings $s$ and $t$ are given. Let $S$ be the set of all cyclic shifts of the string $s$, and $T$ the set of all cyclic shifts of the string $t$. For example, if $s$ = «1234», then $S$ contains the strings «1234», «2341», «3412», «4123». Let $\mathrm{NUM}(A)$ be the set of numbers corresponding to the strings in the set $A$.

Given the strings $s$ and $t$, write a program that finds the maximum number representable as a difference $x - y$, where $x$ belongs to $\mathrm{NUM}(S)$ and $y$ belongs to $\mathrm{NUM}(T)$.

For example, if $s$ = «25» and $t$ = «12», then $\mathrm{NUM}(S)$ contains the numbers 25 and 52, and $\mathrm{NUM}(T)$ contains the numbers 12 and 21. Their pairwise differences are $25 - 12 = 13$, $25 - 21 = 4$, $52 - 12 = 40$, $52 - 21 = 31$. The maximum of these differences is 40.

The first line of the input file contains the string $s$, and the second line contains the string $t$. Both strings are nonempty, contain only digits, at least one of which is not zero, and have length at most 3000 characters.

Output the required number without leading zeros to the output file.