write a go solution for Description:
Polycarp had an array a of 3 positive integers. He wrote out the sums of all non-empty subsequences of this array, sorted them in non-decreasing order, and got an array b of 7 integers.

For example, if a=1,4,3, then Polycarp wrote out 1, 4, 3, 1+4=5, 1+3=4, 4+3=7, 1+4+3=8. After sorting, he got an array b=1,3,4,4,5,7,8.

Unfortunately, Polycarp lost the array a. He only has the array b left. Help him to restore the array a.

Input Format:
The first line contains one integer t (1<=t<=5000) — the number of test cases.

Each test case consists of one line which contains 7 integers b_1,b_2,...,b_7 (1<=b_i<=10^9; b_i<=b_i+1).

Additional constraint on the input: there exists at least one array a which yields this array b as described in the statement.

Output Format:
For each test case, print 3 integers — a_1, a_2 and a_3. If there can be several answers, print any of them.

Note:
The subsequence of the array a is a sequence that can be obtained from a by removing zero or more of its elements.

Two subsequences are considered different if index sets of elements included in them are different. That is, the values of the elements don't matter in the comparison of subsequences. In particular, any array of length 3 has exactly 7 different non-empty subsequences.. Output only the code with no comments, explanation, or additional text.