Bob is given three arrays \(A\), \(B\) and \(C\) of length \(N\) each. A pair of indices \((i,j)\), where \(0 \leq i, j \lt N\) is called good if \(A[i]\) is equal to \(B[C[j]]\).

Find an integer \(X\) denoting the number of good indices.

Input format

• The first line contains an integer \(T\), which denotes the number of test cases.
• The first line of each test case contains an integers \(N\), denoting the size of the array \(A\), \(B\) and \(C\).
• The second line of each test case contains \(N\) space-separated integers, denoting the array \(A\).
• The third line of each test case contains \(N\) space-separated integers, denoting the array \(B\).
• The fourth line of each test case contains \(N\) space-separated integers, denoting the array \(C\).

Output format

For each test case, print an integer \(X\) denoting the number of good indices in a new line.

Constraints

\(1 \leq T \leq 10 \\ 1 \leq N \leq 10^5 \\ 0 \leq A[i], B[i], C[i] \lt N\)