Hidden Rook

This problem is interactive.

Roman hid a rook on an $n \times m$ chessboard. You need to find its exact position. You can ask Roman the following question at most 4 times: "How many cells $(i, j)$, where $X\_1 \le i \le X\_2$ and $Y\_1 \le j \le Y\_2$, are under the hidden rook's attack?" A rook attacks all cells in the same row or column, including its own cell.

The first line contains an integer $t$, the number of test cases ($1 \le t \le 15\\,000$).