You are given two arrays, A and B, of equal size N. The task is to find the minimum value of A * B + A * B +…+ A[N-1] * B[N-1], where shuffling of elements of arrays A and B is allowed.
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains three lines. The first line contains an integer N denoting the size of the arrays. In the second line are N space separated values of the array A, and in the last line are N space separated values of the array B.
For each test case, print the minimum sum.
1 <= T <= 100
1 <= N <= 107
1 <= A <= 1018