CF1272A.Three Friends

Three friends are going to meet each other. Initially, the first friend stays at the position $x = a$, the second friend stays at the position $x = b$ and the third friend stays at the position $x = c$ on the coordinate axis $Ox$.

In one minute each friend independently from other friends can change the position $x$ by $1$ to the left or by $1$ to the right (i.e. set $x := x - 1$ or $x := x + 1$) or even don't change it.

Let's introduce the total pairwise distance — the sum of distances between each pair of friends. Let $a'$, $b'$ and $c'$ be the final positions of the first, the second and the third friend, correspondingly. Then the total pairwise distance is $|a' - b'| + |a' - c'| + |b' - c'|$, where $|x|$ is the absolute value of $x$.

Friends are interested in the minimum total pairwise distance they can reach if they will move optimally. Each friend will move no more than once. So, more formally, they want to know the minimum total pairwise distance they can reach after one minute.

You have to answer $q$ independent test cases.

三位朋友将要彼此会面。最初，第一位朋友位于坐标轴 $Ox$ 上的位置 $x = a$，第二位朋友位于位置 $x = b$，第三位朋友位于位置 $x = c$。

每一分钟，每位朋友均可独立于其他朋友，将自身位置 $x$ 向左移动 $1$（即令 $x := x - 1$），或向右移动 $1$（即令 $x := x + 1$），或者保持不动。

我们定义总两两距离为每对朋友之间距离之和。设 $a'$、$b'$ 和 $c'$ 分别为第一位、第二位和第三位朋友的最终位置，则总两两距离为 $|a' - b'| + |a' - c'| + |b' - c'|$，其中 $|x|$ 表示 $x$ 的绝对值。

朋友们希望知道：若他们以最优方式移动，所能达到的最小总两两距离是多少。每位朋友最多移动一次。更准确地说，他们希望求出经过一分钟之后所能达到的最小总两两距离。

你需要回答 $q$ 个相互独立的测试用例。

The first line of the input contains one integer $q$ ($1 \le q \le 1000$) — the number of test cases.

The next $q$ lines describe test cases. The $i$-th test case is given as three integers $a, b$ and $c$ ($1 \le a, b, c \le 10^9$) — initial positions of the first, second and third friend correspondingly. The positions of friends can be equal.

输入的第一行包含一个整数 $q$（$1 \le q \le 1000$），表示测试用例的数量。

接下来的 $q$ 行描述了各个测试用例。第 $i$ 个测试用例由三个整数 $a, b$ 和 $c$（$1 \le a, b, c \le 10^9$）给出，分别表示第一位、第二位和第三位朋友的初始位置。朋友的位置可以相等。

For each test case print the answer on it — the minimum total pairwise distance (the minimum sum of distances between each pair of friends) if friends change their positions optimally. Each friend will move no more than once. So, more formally, you have to find the minimum total pairwise distance they can reach after one minute.

对于每个测试用例，输出其答案——即朋友们在最优调整位置后所能达到的最小两两间总距离（即所有朋友对之间距离之和的最小值）。每位朋友最多移动一次。更准确地说，你需要求出在一分钟之后他们所能达到的最小两两间总距离。