B"You have n intervals [l_1, r_1], [l_2, r_2], ... , [l_n, r_n] , such that l_i < r_i for each i , and all the endpoints of the intervals are distinct. The i -th interval has weight c_i per unit length. Therefore, the weight of the i -th interval is c_i cdot (r_i - l_i) . You don't like large weights, so you want to make the sum of weights of the intervals as small as possible. It turns out you can perform all the following three operations: However, after performing all of the operations, the intervals must still be valid (i.e., for each i , l_i < r_i must hold). What's the minimum possible sum of weights of the intervals after performing the operations? 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 a single integer n ( 1 <= n <= 10^5 ) -- the number of intervals. The second line of each test case contains n integers l_1, l_2, ldots, l_n ( 1 <= l_i <= 2 cdot 10^5 ) -- the left endpoints of the initial intervals. The third line of each test case contains n integers r_1, r_2, ldots, r_n ( l_i < r_i <= 2 cdot 10^5 ) -- the right endpoints of the initial intervals. It is guaranteed that {l_1, l_2, ... , l_n, r_1, r_2, ... , r_n } are all distinct. The fourth line of each test case contains n integers c_1, c_2, ldots, c_n ( 1 <= c_i <= 10^7 ) -- the initial weights of the intervals per unit length. It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case, output a single integer: the minimum possible sum of weights of the intervals after your operations. In the first test case, you can make In that case, there are two intervals: The sum of the weights is 2400 . It can be shown that there is no configuratio"...