## TEM - Thermal Luminescence

After many years of hard work a group of scientists developed a shiny new state-of-the-art processor with a 3D configuration. Due to the high clock frequency at which this processor works, the silicon cube uses up too much energy. Even with its powerful cooling system, the processor is unable to cope with the heat discharge in some of its cubical blocks. With the help of special analysis methods, scientists have developed the overheat rate for each of the cubical blocks of the system. As it conveniently happens, this overheat rate is an integer value, either positive or negative depending on many factors (such as the proximity of ventilators, refrigerators, etc.).

Science can do no more, so now the developers of the processor need your support. For a given three-dimensional matrix representing the overheat rate of elements of the processor, you have to find a submatrix for which the sum of overheat rates coming from all its elements is maximal.

### Input

*t* – number of test cases [*t* <= 99], then t tests follow.

Each test begins with 3 integers: x, y, z – the width, length and height of matrix [5 <= x, y, z <= 50]. Then there follows the description of x rectangular 2D matrixes of height y and width z. In total there are x*y*z integers, which absolute value does not exceed 10000.

### Output

For each test case you should output 6 integers: x1, y1, z1, x2, y2, z2, where each triple (xi, yi, zi) defines one of the two opposite corners of submatrix, resulting in the maximum overheat. [1 <= x1 <= x2 <= x] [1 <= y1 <= y2 <= y] [1 <= z1 <= z2 <= z]

### Example

Input:1 5 5 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -10 -1 -1 -1 -1 -10 -1 -1 -1 -1 -10 -1 -1 -1 -1 -10 -1 -1 -1 -1 -10 -1 -1 20 2 2 2 20 20 2 2 2 20 20 2 2 2 20 20 2 2 2 20 20 2 2 2 20 5 5 5 5 5 5 5 5 5 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -10 10 -10 10 -10 -10 10 -10 10 -10 -10 10 -10 10 -10 -10 10 -10 10 -10 -10 10 -10 10 -10Output:3 1 1 4 5 5Note:The maximum overheat for the example is equal to 295.

hide comments

:D:
2012-05-02 21:31:04
It's kinda of "trap" problem. A pretty high complexity will get AC here. Don't look for any specific approach to efficiently resolve the 3D aspect. |

Added by: | Roman Sol |

Date: | 2005-04-11 |

Time limit: | 2.316s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |

Resource: | ZCon 2006 |