Halloween Candy

On Halloween, Hanshin's father hands out candy to his children. The siblings do not get along, and even past thirty they will fight unless the candy is split fairly. The father wants to give as many pieces as possible to the children and know how many stay with him. Divide the candy so the fight does not start.

The first line contains the number of test cases $T$. Each test case is one line with the candy count $c$ and the number of siblings $v$.

For each test case, print one line in the form You get __ piece(s) and your dad gets __ piece(s). Replace each __ with an integer.

• $1 \leq c, v \leq 1{,}000$