Codeforce 35C 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.

Input

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: x1, y1, x2, y2, …, xk, yk (1 ≤ xi ≤ N, 1 ≤ yi ≤ M) — coordinates of the points from which the fire started. It is guaranteed that no two points coincide.

Output

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.

Input

3 3
1
2 2

Output

1 1

Input

3 3
1
1 1

Output

3 3

Input

3 3
2
1 1 3 3

Output

2 2

解：

有一个n*m的矩阵，每个点都是一棵树，给k个坐标表示起火的树，每秒蔓延距离为1的树，求最后剩下的树的坐标，输出任何一个就行。一般来说是用bfs搜索标记，但是我图论很菜，就直接求的距离，输出最大的那个就行，注意题目输入输出的格式。

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 2010;
const ll mod = 1000000007;
struct node
{
    int x, y;
} qwq[11];
int mp[N][N];
int main()
{
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    ios :: sync_with_stdio(0);
    int n, m, k;
    cin >> n >> m >> k;
    for(int i = 1; i <= k; ++i)
        cin >> qwq[i].x >> qwq[i].y;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            mp[i][j] = 1e6;
    for(int i = 1; i <= k; ++i)
    {
        for(int j = 1; j <= n; ++j)
        {
            for(int s = 1; s <= m; ++s)
            {
                int xx = abs(j - qwq[i].x);
                int yy = abs(s - qwq[i].y);
                mp[j][s] = min(xx+yy, mp[j][s]);
            }
        }
    }
    int ans = INT_MIN, ansx, ansy;
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= m; ++j)
        {
            if(ans < mp[i][j])
            {
                ans = mp[i][j];
                ansx = i;
                ansy = j;
            }
        }
    }
    cout << ansx << " " << ansy << '\n';
    return 0;
}```