Jacana Number

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 153428/153428 K (Java/Others)

Description

This problem is very simple problem.
We define J(n,k) like this:
1. J(n,1)=n
2. J(n,k)=$n^{J(n,k-1)}$ (k=2,3,…)
We call this number “Jacana Number”.
In this problem you are given two jacana numbers and you must output which Jacana Number is greater than the other.

Input

The first line contains an integer T (1 <= T <= 10000), the number of test cases.
Each test case contains four integers n, a, m, b (1 <= n, a, m, b <= $10^9$)

Output

For each test case output one of (‘>’, ‘=’, ‘<’) in one line.
If J(n,a)> J(m,b), output ‘>’.
If J(n,a)= J(m,b), output ‘=’.
If J(n,a)< J(m,b), output ‘<’.

Sample Input

3 2 2 3 1 2 3 3 2 1 2 1 4

Sample Output

> < =

Hint

liuyiding

Source

2017 Multi-University Training Contest - Te

提交代码