时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
For a string , Bobo defines
, which is
repeats for infinite times, resulting in a string of infinite length.
Bobo has two strings and
. Find out the result comparing
and
in lexicographical order.
You can refer the wiki page for further information of Lexicographical Order.
输入描述:
The input consists of several test cases terminated by end-of-file.
The first line of each test case contains a string a, and the second line contains a string b.
*
* a, b consists of lower case letters.
* The total length of input strings does not exceed.
输出描述:
For each test case, print "`=`" (without quotes) if. Otherwise, print "`<`" if
, or "`>`" if
.