Sequence Transformation Challenge

You are given an initial sequence and a target sequence. Your task is to transform the initial sequence into the target sequence using the minimum number of operations. The allowed operations are:

• Swap any two elements.
• Reverse any contiguous subsequence. The reversal of a subsequence from index \(i\) to \(j\) is denoted by \(\texttt{reverse}(i, j)\).
• Rotate the entire sequence to the right by one position.

If it is impossible to transform the initial sequence into the target sequence (for example, if the sequences contain different multisets of numbers), output \(-1\). Otherwise, output the minimum number of operations required.

Input format: The first line contains an integer \(T\) denoting the number of test cases. For each test case, there are two lines: the first line contains the initial sequence (space-separated integers) and the second line contains the target sequence (space-separated integers).

Output format: For each test case, output a single line containing a single integer representing the minimum number of operations needed.

inputFormat

The input begins with an integer \(T\) on the first line, representing the number of test cases. Each test case consists of two lines:

1. The first line is the initial sequence of integers separated by spaces.
2. The second line is the target sequence of integers separated by spaces.

outputFormat

For each test case, output the minimum number of operations required to transform the initial sequence into the target sequence, or \(-1\) if it is not possible. Each result should be printed on a separate line.

## sample

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

1
2
0
1
-1

</p>