Abid has chocolates. His friends Raju, Rifat and Sagor are planning to get those chocolates while Abid is sleeping. Let’s say the number of chocolates Raju gets is , Rifat is and Sagor is . They want to divide those chocolates in such a way that following condition holds:
.
Let , must be minimized.
.
You have to find these three integers.
First line of input will contain an integer indicating the number of test cases.
For each test case, a single integer will be given in a single line.
For each test case, print integers , and which satisfies the conditions in statement.
Input | Output |
---|---|
2 3 4 | 1 1 1 1 1 2 |