Problem G. 7. Treasure
Input file name: standard input
Output file name: standard output
Time limit: 1 s
Memory limit: 1024 MB
Output file name: standard output
Time limit: 1 s
Memory limit: 1024 MB
A rectangular N \times M island is divided into hexagonal cells. The first cell of the first row is always to the left of the first cell of the second row.
One of the cells contains a hidden treasure chest.
The pirate dug three holes in different cells but didn’t find the chest. However, in each of these holes, he found clues pointing out that the treasure is exactly Z cells away.
Help the pirate locate the treasure.
The pirate dug three holes in different cells but didn’t find the chest. However, in each of these holes, he found clues pointing out that the treasure is exactly Z cells away.
Help the pirate locate the treasure.
Input
The first line contains the dimensions of the island: N, M (2 \le N, M \le 10).
The next three lines contain integers X, Y, Z (1 \le X \le N, 1 \le Y \le M).
Here, X is the row number, Y is the column number, and Z is the number of cells away where the treasure is located.
It is guaranteed that there is exactly one possible treasure location.
The next three lines contain integers X, Y, Z (1 \le X \le N, 1 \le Y \le M).
Here, X is the row number, Y is the column number, and Z is the number of cells away where the treasure is located.
It is guaranteed that there is exactly one possible treasure location.
Output
Print the coordinates of the treasure cell: row and column numbers separated by a space.
Example
| standard input | standard output |
|---|---|
| 7 9 2 2 3 6 8 5 7 4 4 | 3 5 |
Note
Explanation for the first test case:
