B. Bad Boy
constructive algorithms; greedy; math
Riley is a very bad boy, but at the same time, he is a yo-yo master. So, he decided to use his yo-yo skills to annoy his friend Anton.Anton's room can be represented as a grid with \(n\) rows and \(m\) columns. Let \((i, j)\) denote the cell in row \(i\) and column \(j\). Anton is currently standing at position \((i, j)\) in his room. To annoy Anton, Riley decided to throw exactly two yo-yos in cells of the room (they can be in the same cell).Because Anton doesn't like yo-yos thrown on the floor, he has to pick up both of them and return back to the initial position. The distance travelled by Anton is the shortest path that goes through the positions of both yo-yos and returns back to \((i, j)\) by travelling only to adjacent by side cells. That is, if he is in cell \((x, y)\) then he can travel to the cells \((x + 1, y)\), \((x - 1, y)\), \((x, y + 1)\) and \((x, y - 1)\) in one step (if a cell with those coordinates exists).Riley is wondering where he should throw these two yo-yos so that the distance travelled by Anton is maximized. But because he is very busy, he asked you to tell him.
The first line contains a single integer \(t\) (\(1 \leq t \leq 10^4\)) — the number of test cases. Then \(t\) test cases follow.The only line of each test case contains four integers \(n\), \(m\), \(i\), \(j\) (\(1 \leq n, m \leq 10^9\), \(1\le i\le n\), \(1\le j\le m\)) — the dimensions of the room, and the cell at which Anton is currently standing.
For each test case, print four integers \(x_1\), \(y_1\), \(x_2\), \(y_2\) (\(1 \leq x_1, x_2 \leq n\), \(1\le y_1, y_2\le m\)) — the coordinates of where the two yo-yos should be thrown. They will be thrown at coordinates \((x_1,y_1)\) and \((x_2,y_2)\).If there are multiple answers, you may print any.
Here is a visualization of the first test case.