You will be given three numbers A,B,C .You can perform the following operation on these numbers any number of times.You can take any integer from A, B, C and you can add or substract 1 from it.
Each operation cost 1sec of time(say). Now you have to determine the minimum time required to change those numbers into an Arithmetic Progression.
i.e B-A=C-B
Input :
First line of input contains T denoting number of test cases.
Next T lines contains space seperated integers A,B,C
Output :
For each test case, print a single line containing one integer — the minimum time require to change A,B,C into an arithmetic progression.
Constraints :
1<=T<=100000
−108<=A,B,C<=108
Example case 1: No operations are needed because 0-(-5) = 5-0.
Example case 2: We can obtain an arithmetic progression in seven operations by adding 1 to A = -5 and subtracting 1 six times from B = 7.
Example case 3: We should add 1 to B 105 times.
