CF35C.Fire Again

After a terrifying forest fire in Berland a forest rebirth program was carried out. Due to it N rows with M trees each were planted and the rows were so neat that one could map it on a system of coordinates so that the j-th tree in the i-th row would have the coordinates of (i, j). However a terrible thing happened and the young forest caught fire. Now we must find the coordinates of the tree that will catch fire last to plan evacuation.

The burning began in K points simultaneously, which means that initially K trees started to burn. Every minute the fire gets from the burning trees to the ones that aren’t burning and that the distance from them to the nearest burning tree equals to 1.

Find the tree that will be the last to start burning. If there are several such trees, output any.

在贝尔兰发生了一场可怕的森林火灾后，当地实施了一项森林再生计划。根据该计划，共种植了 $N$ 行树，每行 $M$ 棵，且排列极为整齐，可将其映射到坐标系中，使得第 $i$ 行的第 $j$ 棵树的坐标为 $(i,\,j)$。然而，一场灾难发生了——这片年轻的森林再次起火。现在我们必须找出最后开始燃烧的那棵树的坐标，以便规划人员撤离。

火灾同时从 $K$ 个点开始，即初始时刻共有 $K$ 棵树着火。此后，每一分钟，火焰都会从已着火的树蔓延至尚未着火、且到最近着火树的距离恰好为 1 的树。

请找出最后开始燃烧的那棵树。若存在多个满足条件的树，输出任意一个即可。

The first input line contains two integers N, M (1 ≤ N, M ≤ 2000) — the size of the forest. The trees were planted in all points of the (x, y) (1 ≤ x ≤ N, 1 ≤ y ≤ M) type, x and y are integers.

The second line contains an integer K (1 ≤ K ≤ 10) — amount of trees, burning in the beginning.

The third line contains K pairs of integers: _x_1, _y_1, _x_2, _y_2, ..., x__k, y__k (1 ≤ x__i ≤ N, 1 ≤ y__i ≤ M) — coordinates of the points from which the fire started. It is guaranteed that no two points coincide.

第一行输入包含两个整数 $N$、$M$（$1 \leq N, M \leq 2000$）——森林的尺寸。树木种植在所有形如 $(x, y)$ 的点上（其中 $1 \leq x \leq N$，$1 \leq y \leq M$），且 $x$ 和 $y$ 均为整数。

第二行输入包含一个整数 $K$（$1 \leq K \leq 10$）——初始着火的树木数量。

第三行输入包含 $K$ 对整数：$x_1,\ y_1,\ x_2,\ y_2,\ \dots,\ x_K,\ y_K$（其中 $1 \leq x_i \leq N$，$1 \leq y_i \leq M$）——火灾起始点的坐标。保证任意两点互不重合。

Output a line with two space-separated integers x and y — coordinates of the tree that will be the last one to start burning. If there are several such trees, output any.

输出一行，包含两个用空格分隔的整数 $x$ 和 $y$ —— 表示最后开始燃烧的树的坐标。如果存在多个满足条件的树，输出任意一个即可。