"It's a bird, it's a plane, it's Superman!"

Clark Kent was chilling with Lois, when suddenly Lex Luthor put his new plan to conquer Metropolis in action. Lex has set n buildings on fire, so that Superman is distracted while he carries out a robbery in S.T.A.R Labs.

However, Lex didn't plan the fires very well, so the buildings that his henchmen have set fire to all lie on the same horizontal straight line. Now, Superman can put out all the fires in any order, but he wishes to minimize the damage, so he wants to travel the smallest distance possible. Help Superman find this smallest distance.

Superman can start putting out fires at ANY building and end at ANY building.

Only the distances between buildings are counted.

INPUT:

The first line of input contains the number of test cases, t.

Each test case consists of 2 lines.

The first line of each test case contains the number of buildings (n) Lex has set fire to.

The second line contains the x - coordinate of n buildings (x1, x2, ... xn)

OUTPUT:

For each test case, print the smallest distance that Superman has to travel so as to put out the fires in all the buildings.

CONSTRAINTS:

1 <= t <= 100

1 <= n <= 10000

1 <= xi <= 1000000