Walking Santa Claus

Santa Claus wants to hand out chocolate cakes to the children of a certain district. The district's roads form a grid: there are $W$ north-south roads and $H$ east-west roads. The north-south roads are numbered $1, 2, \dots, W$ from west to east, and the east-west roads are numbered $1, 2, \dots, H$ from south to north. The intersection of the $x$-th north-south road (counting from the west) and the $y$-th east-west road (counting from the south) is written as $(x, y)$. Every house sits on an intersection, and there are $N$ houses in total. Santa can move only along the roads, and moving between two adjacent intersections takes time $1$ (so the travel time between intersections $(x_1, y_1)$ and $(x_2, y_2)$ is $|x_1 - x_2| + |y_1 - y_2|$).

Santa parks Rudolph at one intersection and walks from there to deliver the cakes. He can carry only one cake at a time, so after delivering to a house he must return to the intersection where Rudolph waits, pick up the next cake, and set out again. He wants to minimize the total time needed to deliver a cake to every house. However, after delivering the cake to the last house he does not go back to Rudolph, so that final return trip is not counted.

Given the positions of the houses, determine at which intersection Santa should park Rudolph so that the delivery time is minimized, and report that minimum time.

The first line contains the number of north-south roads $W$ and the number of east-west roads $H$. ($1 \le W, H \le 10^9$)

The second line contains the number of houses $N$. ($1 \le N \le 10^5$)

Each of the next $N$ lines contains the position $x$ and $y$ of one house. No intersection holds more than one house.

On the first line, print the minimum time needed to deliver a cake to every house. On the second line, print the position $x$ and $y$ of the intersection where Rudolph should be parked. If several intersections achieve the minimum, print the one farthest to the west (smallest $x$); if there is still a tie, print the one farthest to the south (smallest $y$).