407241: GYM102700 K Katastrophic sort

Some students at the UNAL are learning how the computer works. So the great teacher is talking about how the files are sorted by name. Do you know how that works?. Well, they are ordered by the well known Katastrophic sort!.

Let's define Katastrophic sort: is an ordering of strings in lexicographical order, except that numbers are treated atomically, i.e., as if they were a single character.

Let's see an example If we sort strings z11 and z2 by lexicographical sorting we get:

But if we sort them by Katastrophic sorting we get:

Since both start by "z" the order is defined by the order of the numeric part. And as humans, we know that 2 is less than 11.

In order to test your understanding, the teacher gives you two strings. You need to output which one is less than the other.

You are given 2 lines. In each line one of the strings to compare. The length of each string is at most $$$10^5$$$.

Each string will consist of a non-empty english lowercase alphabetic part followed with a non-empty numeric part

It is guaranteed that the numeric parts in the strings are integers and won't have leading zeroes.

It is guaranteed that the alphabetic part has the same length in both strings.

Print < if the first string is less than the second according to the Katastrophic sort. > if the first string is greater than second according to the Katastrophic sort and = otherwise.

z2
z11

<

abd14
abc14

>

asgfsd4213456
asgfsd4213456

=