0.3 Battle of the Dorms

Score: 15pts

Time Limit: 5.00 sec

At Geekville University, the annual Dorm Wars are underway. Each dorm—Alpha, Beta, and Gamma—competes to earn the most points in various challenges. As the competition heats up, the teams need to figure out how many more points are necessary to secure a win over the others.

Given the current points of each dorm, determine the minimum additional points needed for each dorm to ensure they have more points than both of the others.

Please note that for each candidate it is necessary to solve this problem independently, i.e. the added votes for any candidate do not affect the calculations when getting the answer for the other two candidates.

Given the current points of each dorm, determine the minimum additional points needed for each dorm to ensure they have more points than both of the others.

Please note that for each candidate it is necessary to solve this problem independently, i.e. the added votes for any candidate do not affect the calculations when getting the answer for the other two candidates.

Constraints

0 ≤ Alpha, Beta, Gamma ≤ 10^9

1 ≤ t ≤ 10^4

1 ≤ t ≤ 10^4

Input Format

The first line contains one integer t — the number of test cases.

Then t test cases follow, each consisting of one line containing three integers Alpha, Beta, and Gamma.

Then t test cases follow, each consisting of one line containing three integers Alpha, Beta, and Gamma.

Output Format

For each test case, output in a separate line three integers Alpha, Beta, and Gamma (Alpha, Beta, Gamma ≥ 0) separated by spaces — the answers to the problem for the first, second, and third candidate, respectively.

Example 1

Input:

1

10 75 15

Output:

66 0 61

Explanation:

Self explanatory

1

10 75 15

Output:

66 0 61

Explanation:

Self explanatory