+ Time Limit: 1 second + Memory Limit: 256 MB ---------- There's a treasure hidden at some integer point $(a, b)$ such that $0 \leq a \leq n$ and $0 \leq b \leq m$. The Manhattan distance between two points $(s, t)$ and $(u, v)$ is defined as $|s - u| + |t - v|$. We are given two numbers: the Manhattan distance from $(a, b)$ to $(0, 0)$ is $x$, and its distance to $(0, m)$ is $y$. Check whether such a treasure can exist. If no valid treasure exists, print $-1$. It can be proved that if a solution exists, it is unique. # Input The first line of input contains an integer $t$, the number of test cases. $$1 \leq t \leq 10^4$$ Each of the next $t$ lines contains four integers: $n$, $m$, $x$, and $y$. $$1 \leq n, m \leq 10^8$$ $$0 \leq x, y \leq n + m$$ # Output For each test case, print two integers $a$ and $b$, the coordinates of the treasure. If no valid treasure exists, print $-1$. # Subtasks | condition | score | | :---------------------: | :---: | | $n, m, t \leq 100$ | `30` | | No additional condition | `70` | # Examples ### Sample Input 1 ``` 5 100 100 40 80 100 100 40 81 12 65 0 65 1 1 2 1 3 2 5 5 ``` ### Sample Output 1 ``` 10 30 -1 0 0 1 1 -1 ```