Construction of a warehouse#1892
On a map of size M \times N, a hero can build a warehouse in one of the map's cells and store various items scattered around the map. In each move, the hero may:
Move to an adjacent cell, either horizontally or vertically.
Pick up one item if there is at least one item in the current cell and the hero's inventory is empty (the items are too heavy to carry more than one at a time).
Deposit the item from the inventory into the warehouse if the hero is in the cell where the warehouse is located.
Kolya wants to determine the cell for the warehouse so that, after its construction, the total number of moves needed to collect and store all items is minimized.
The first line contains two integers, and , representing the size of the map (1 \leq M, N \leq 1000). The following lines each contain integers, indicating the number of items in each corresponding cell. All these numbers are non-negative and do not exceed .
Print the coordinates (row and column) of the cell where the warehouse should be built on the first line. On the second line, print the minimum number of moves required to collect and store all the items. Note: if an item is already at the cell of the warehouse, it must still be picked up and deposited into the warehouse.
Example 1