Teacher brought a fruit basket for three students. The basket contains only Apples, Mangoes and Oranges. Student A knows a value $a$, the total number of Apples and Mangoes in the Basket, B knows a value $b$, the total number of Mangoes and Oranges in the basket and Student C knows a value $c$, the total number of Oranges and Apples in the Basket. Since the teacher brought it he knows a value $d$ , the total number of fruits in the basket. You have to determine the exact number of Apples , Mangoes and Oranges in the basket separately.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- Each testcase contains of a single line of input, four integers $a,b,c,d$. 
-----Output:-----
For each testcase, output in a single line the number of Apples , Mangoes and Oranges in this order.
-----Constraints-----
- $1 \leq T \leq 100$
- $0 \leq a \leq 1000$
- $0 \leq b \leq 1000$
- $0 \leq c \leq 1000$
- $0 \leq d \leq 1000$ 
-The Solution always exisits
-----Sample Input:-----
2
7 9 8 12
3 8 7 9
-----Sample Output:-----
3 4 5
1 2 6
for _ in range(int(input())):
 a,b,c,d=map(int,input().split())
 print(c-d+a,b-d+a,d-a)
for _ in range(int(input())):
 a,b,c,d=map(int,input().split())
 print(c-d+a,b-d+a,d-a)