B"There are n block towers in a row, where tower i has a height of a_i . You're part of a building crew, and you want to make the buildings look as nice as possible. In a single day, you can perform the following operation: You think the ugliness of the buildings is the height difference between the tallest and shortest buildings. Formally, the ugliness is defined as max(a)- min(a) . What's the minimum possible ugliness you can achieve, after any number of days? The first line contains one integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. Then t cases follow. The first line of each test case contains one integer n ( 2 <= q n <= q 100 ) -- the number of buildings. The second line of each test case contains n space separated integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 10^7 ) -- the heights of the buildings. For each test case, output a single integer -- the minimum possible ugliness of the buildings. In the first test case, the ugliness is already 0 . In the second test case, you should do one operation, with i = 1 and j = 3 . The new heights will now be [2, 2, 2, 2] , with an ugliness of 0 . In the third test case, you may do three operations: "...