Given three sets of integers of the same size: A, B and C. Your task is to calculate how many triplet {i, j, k} such that A_{ i} + B_{ j} + C_{ k} = 0.
The first line of input contains an integer T (1 ≤ T ≤ 100) the number of cases. Each case begins with an integer N (1 ≤ N ≤ 2,000) the size of each set of integer. The next three lines each contains N integers range from 1,000,000,000 to 1,000,000,000. Each line represent A, B and C respectively.
For each test case, output in a line the number of different triplets.

Explanation for the 1^{st} sample input.
There is only one triplet that sums to zero: {0, 0, 1} which corresponds to 0 + (1) + 1 = 0.
Explanation for the 2^{nd} sample input.
There are three triplets that sum to zero: