## Infinity Table solution codeforces

Polycarp has found a table having an infinite number of rows and columns. The rows are numbered from 11, starting from the topmost one. The columns are numbered from 11, starting from the leftmost one.

Initially, the table hasn’t been filled and Polycarp wants to fix it. He writes integers from 11 and so on to the table as follows.

First, Polycarp selects the leftmost non-filled cell in the first row and fills it. Then, while the left neighbor of the last filled cell is filled, he goes down and fills the next cell. So he goes down until the last filled cell has a non-filled neighbor to the left (look at the vertical arrow going down in the figure above).

After that, he fills the cells from the right to the left until he stops at the first column (look at the horizontal row in the figure above). Then Polycarp selects the leftmost non-filled cell in the first row, goes down, and so on.

A friend of Polycarp has a favorite number kk. He wants to know which cell will contain the number. Help him to find the indices of the row and the column, such that the intersection of the row and the column is the cell containing the number kk.

The first line contains one integer tt (1≤t≤1001≤t≤100) — the number of test cases. Then tt test cases follow.

Each test case consists of one line containing one integer kk (1≤k≤1091≤k≤109) which location must be found.

For each test case, output in a separate line two integers rr and cc (r,c≥1r,c≥1) separated by spaces — the indices of the row and the column containing the cell filled by the number kk, respectively.

7 11 14 5 4 1 2 1000000000

2 4 4 3 1 3 2 1 1 1 1 2 31623 14130