Codeforces Round #748 (Div. 3) A. Elections

题目链接：Problem - A - Codeforces

The elections in which three candidates participated have recently ended. The first candidate received aa votes, the second one received bb votes, the third one received cc votes. For each candidate, solve the following problem: how many votes should be added to this candidate so that he wins the election (i.e. the number of votes for this candidate was strictly greater than the number of votes for any other candidate)?

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.

Input

The first line contains one integer tt (1≤t≤10^4) — the number of test cases. Then tt test cases follow.

Each test case consists of one line containing three integers a, b, and c (0≤a,b,c≤10^9).

Output

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

Example

input

Copy

5
0 0 0
10 75 15
13 13 17
1000 0 0
0 1000000000 0

output

Copy

1 1 1
66 0 61
5 5 0
0 1001 1001
1000000001 0 1000000001

题意： 分开求出a， b， c要想获胜需要增加几票

思路可以通过另外两个人的最大票数+ 1 - 本人票数的方法，但是如果票数小于0的话需要改成0

#include<bits/stdc++.h>
using namespace std;
 
 
int main(){
	int t;
	cin >> t;
	long long a, b, c;
	while(t--){
		cin >> a >>  b >> c;
		if(a > b && a > c){
			cout << "0" << " ";
		}else{
			cout << max(b, c) + 1 - a << " ";
		}
		if(b > a && b > c){
			cout << "0 " << " ";
		}else{
			cout << max(a, c) + 1 - b << " ";
		}
		if(c > a && c > b){
			cout << 0 << endl;
		}else{
			cout << max(a, b) + 1 - c << endl;
		}
	}
	return 0;
}