Space Expedition#5470
In 2004, the inhabitants of the planet Cremonid organized a space expedition to travel to a neighboring galaxy, where they believed there was a planet suitable for life. A residential complex was constructed on the spaceship to accommodate many scientists.
The residential complex is shaped as a rectangular parallelepiped with dimensions n \times m \times k. The complex is divided into cubic compartments of size 1 \times 1 \times 1, resulting in a total of compartments. Each compartment has coordinates (x, y, z), corresponding to its position in the complex, where 1 \le x \le n, 1 \le y \le m, 1 \le z \le k.
The distance between two compartments with coordinates (x_1, y_1, z_1) and (x_2, y_2, z_2) is defined as:
Two compartments are in the same row if their coordinates differ by exactly one component (for example, (2, 4, 3) and (2, 6, 3) are in the same row). Two compartments are adjacent if the distance between them is one.
A personal computer was installed in each compartment. After launch, the residents of the complex decided to connect their computers into a network. The network installation plan is as follows: select two compartments in the same row. The first is called the starting compartment, the second the ending compartment. The robot that lays the network starts in the starting compartment. At each step, the robot moves to the adjacent compartment whose distance to the ending compartment is minimal. Along the way, it connects the computers in adjacent compartments through which it passes, unless this would create a cycle. If such a connection would create a cycle, the robot remembers the coordinates of that pair of adjacent compartments and does not connect their computers. The robot continues until it reaches the ending compartment.
This procedure is repeated times.
Your task is to determine which pairs of compartments the robot remembered.
The first line of the input contains four numbers: , , , (2 \le n, m, k \le 100, 1 \le q \le 20000).
The following lines each describe a pair of compartments between which the robot moves. Each line contains six numbers: the first three are the coordinates of the starting compartment, and the next three are the coordinates of the ending compartment.
For each pair of compartments the robot remembered, output a line with six numbers: the coordinates of the compartments in the order they were traversed by the robot.
Example 1