B'Let a , b , and c be integers. We define function f(a, b, c) as follows: Order the numbers a , b , c in such a way that a <= b <= c . Then return gcd(a, b) , where gcd(a, b) denotes the greatest common divisor (GCD) of integers a and b . So basically, we take the gcd of the 2 smaller values and ignore the biggest one. You are given an array a of n elements. Compute the sum of f(a_i, a_j, a_k) for each i , j , k , such that 1 <= i < j < k <= n . More formally, compute sum_{i = 1}^n sum_{j = i+1}^n sum_{k =j +1}^n f(a_i, a_j, a_k). Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10 ). The description of the test cases follows. The first line of each test case contains a single integer n ( 3 <= n <= 8 cdot 10^4 ) -- length of the array a . The second line of each test case contains n integers, a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^5 ) -- elements of the array a . It is guaranteed that the sum of n over all test cases does not exceed 8 cdot 10^4 . For each test case, output a single number -- the sum from the problem statement. In the first test case, the values of f are as follows: In the second test case, there are 56 ways to choose values of i , j , k . The sum over all f(a_i,a_j,a_k) is 203 . '...