and are permutaions of length . Initiallly, for all . is a sequence of permutations such that and for all and .

There are three types of operations, where and are positive integers:

1.  swap_a x y: swap and , where , ;
2.  swap_p x y: swap and , where , ;
3.  cmp x y: compare with lexicographically.

For each operation 3, output the relationship between and . A permutation is lexicographically samller than a permutation if and only if there exists an index such that and for all .

输入描述:

There are multiple test cases. The first line of input contains an integer (), the number of test cases. For each test case:

The first line contains an integer  and  (, ) - the length of the permutations and the number of operations.

Each of the following  lines contains one string  and two integers  and  representing an operation.  is one of ”swap_a”, ”swap_p” and ”cmp”. If  is one of ”swap_a” and ”swap_p”, , . If  is ”cmp”, , .

It is guaranteed that the sum of  and the sum of  over all tests do not exceed .

输出描述:

For each test case:

For each query, output ”<” if  is lexicographically smaller than ; output ”>” if  is lexicographically greater than  (i.e.,  is lexicographically smaller than ); output ”=” if .

2
5 5
cmp 1 2
swap_p 1 2
cmp 1 2
swap_a 1 2
cmp 1 2
1 1
swap_a 1 1

=
<
>