B"You are given a permutation p of length n , an array of m distinct integers a_1, a_2, ldots, a_m ( 1 <= a_i <= n ), and an integer d . Let mathrm{pos}(x) be the index of x in the permutation p . The array a is not good if For example, with the permutation p = [4, 2, 1, 3, 6, 5] and d = 2 : In one move, you can swap two adjacent elements of the permutation p . What is the minimum number of moves needed such that the array a becomes good? It can be shown that there always exists a sequence of moves so that the array a becomes good. A permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation ( 2 appears twice in the array) and [1,3,4] is also not a permutation ( n=3 , but there is 4 in the array). Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The first line of each test case contains three integers n , m and d ( 2 <= q n <= q 10^5 , 2 <= q m <= q n , 1 <= d <= n ), the length of the permutation p , the length of the array a and the value of d . The second line contains n integers p_1, p_2, ldots, p_n ( 1 <= q p_i <= q n , p_i ne p_j for i ne j ). The third line contains m distinct integers a_1, a_2, ldots, a_m ( 1 <= q a_i <= q n , a_i ne a_j for i ne j ). The sum of n over all test cases doesn't exceed 5 cdot 10^5 . For each test case, print the minimum number of moves needed such that the array a becomes good. In the first case, pos(a_1)=1 , pos(a_2)=3 . To make the array good, one way is to swap p_3 and p_4 . After that, the array a will be good b"...