Ektar Beshi Noy, Shunno Hole Valo Hoy

Abid has $n$ 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 $a$, Rifat is $b$ and Sagor is $c$. They want to divide those chocolates in such a way that following condition holds:

• $a+b+c=n$.

• Let $X=$ $|a-b|+|b-c|+|c-a|$, $X$ must be minimized.

• $a \leq b \leq c$.

You have to find these three integers.

Input

First line of input will contain an integer $T(1 \leq T \leq 1000)$ indicating the number of test cases.

For each test case, a single integer $n(3 \leq n \leq 1000)$ will be given in a single line.

Output

For each test case, print $3$ integers $a$, $b$ and $c$ which satisfies the conditions in statement.

Sample

Input	Output
2 3 4	1 1 1 1 1 2