Poornima is celebrating its annual Techno-Cultural Fest AAROHAN. The IT student Kriti has agreed to supply candies for this festive season.

The Kriti has prepared N boxes of candies, numbered 1 to N (Each number occurring exactly once ). The Kriti is very particular about the arrangement of boxes. He wants boxes to be arranged in a particular order, but unfortunately Kriti is busy. He has asked you to rearrange the boxes for him.

Given the current order of boxes, you have to rearrange the boxes in the specified order. However there is a restriction.You can only swap two adjacent boxes to achieve the required order. Output, the minimum number of such adjacent swaps required.

Input

First line of input contains a single integer T, number of test cases. Each test case contains 3 lines, first line contains a single integer N, number of boxes. Next 2 lines contains N numbers each, first row is the given order of boxes while second row is the required order.

Output

For each test case, output a single integer 'K', minimum number of adjacent swaps required.

Constraints:

1<=T<=10 1<=N<=10^5