Number Tower and Queries

Uichan enjoys stacking towers of blocks with numbers on them. One day Seonu found that the towers Uichan builds follow a rule. The rule Seonu found is as follows.

• The tower Uichan builds has its top at floor $1$, and floor $1$ has $a$ blocks.
• The leftmost block on floor $1$ is marked $1$, and the numbers increase by $1$ moving to the right.
• The leftmost block on floor $i+1$ is $1$ greater than the rightmost block on floor $i$.
• Floor $i+1$ has $d$ more blocks than floor $i$.

The figure below shows the tower Uichan built from floor $1$ to floor $4$ with $a=1$ and $d=2$.

Uichan has memorized the position of every numbered block, and he answers $Q$ queries from Seonu. Each query has one form.

• a d x: Given $a$ and $d$, which floor holds the block numbered $x$, and which position from the left on that floor is it?

Take the figure above as an example. If $a=1$, $d=2$, and $x=12$, Uichan answers $(4,3)$. This means the block numbered $12$ is the 3rd number on floor 4.

The first line contains the number of queries $Q$ that Seonu asks Uichan. $(1\leq Q \leq 500\,000)$

The next $Q$ lines each contain $a$, $d$, and $x$, separated by spaces. $(1\leq a,d,x \leq 10^{6})$

All values in the input are integers.

For each of the $Q$ lines, print the floor where the block numbered $x$ is located, and its position counted from the leftmost block on that floor.