B'There are n customers in the cafeteria. Each of them wants to buy a hamburger. The i -th customer has a_i coins, and they will buy a hamburger if it costs at most a_i coins. Suppose the cost of the hamburger is m . Then the number of coins the cafeteria earns is m multiplied by the number of people who buy a hamburger if it costs m . Your task is to calculate the maximum number of coins the cafeteria can earn. The first line contains one integer t ( 1 <= t <= 100 ) -- the number of test cases. Each test case consists of two lines. The first line contains one integer n ( 1 <= n <= 100 ) -- the number of customers. The second line contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^{12} ), where a_i is the number of coins the i -th customer has. For each test case, print one integer -- the maximum number of coins the cafeteria can earn. Explanations for the test cases of the example: '...