Problem: 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.

Examples

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

Solution (in JAVA):

Solution:
import javax.annotation.processing.SupportedSourceVersion;
import java.io.*;
import java.util.*;
import java.util.regex.Matcher;

public class Main {

    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(new FileReader("input.txt")); // new InputReader(inputStream);
        PrintWriter out = new PrintWriter("output.txt"); //new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(in, out);
        out.close();
    }

    private static class TaskB {

        static final long max = 1000000000000000000L;
        static final double eps = 0.0000001;
        static final long mod = 1000000007;
        static int N, M, K;
        static long X, Y;
        static boolean F[][][];
        static int D[][];

        void solve(InputReader in, PrintWriter out) throws IOException {

            N = in.nextInt();
            M = in.nextInt();
            K = in.nextInt();

            F = new boolean[K][N][M];
            D = new int[N][M];

            for (int i = 0; i < N; i++)
                for (int j = 0; j < M; j++)
                    D[i][j] = Integer.MAX_VALUE;

            List<Pair> list = new ArrayList<>();

            for (int i = 0; i < K; i++) {
                list.add(new Pair(in.nextInt() - 1, in.nextInt() - 1));
            }


            for (int i = 0; i < N; i++)
                for (int j = 0; j < M; j++)
                    for (int k = 0; k < K; k++)
                        D[i][j] = Math.min(D[i][j], Math.abs(list.get(k).X - i) + Math.abs(list.get(k).Y - j));


            int res = Integer.MIN_VALUE;
            for (int j = 0; j < N; j++)
                for (int k = 0; k < M; k++)
                    if (D[j][k] > res) {
                        X = j + 1;
                        Y = k + 1;
                        res = D[j][k];
                    }

            out.println(X + " " + Y);

        }

        void bfs(int K, Pair P) {

            Queue<Pair> Q = new LinkedList<>();
            F[K][P.X][P.Y] = true;
            D[P.X][P.Y] = 0;
            Q.add(P);


            while (!Q.isEmpty()) {

                P = Q.poll();
                int X = P.X;
                int Y = P.Y;

                if (check(X - 1, Y) && !F[K][X - 1][Y]) {
                    F[K][X - 1][Y] = true;
                    if (D[X - 1][Y] > D[X][Y] + 1) {
                        D[X - 1][Y] = D[X][Y] + 1;
                        Q.add(new Pair(X - 1, Y));
                    }
                }

                if (check(X + 1, Y) && !F[K][X + 1][Y]) {
                    F[K][X + 1][Y] = true;
                    if (D[X + 1][Y] > D[X][Y] + 1) {
                        D[X + 1][Y] = D[X][Y] + 1;
                        Q.add(new Pair(X + 1, Y));
                    }
                }

                if (check(X, Y - 1) && !F[K][X][Y - 1]) {
                    F[K][X][Y - 1] = true;
                    if (D[X][Y - 1] > D[X][Y] + 1) {
                        D[X][Y - 1] = D[X][Y] + 1;
                        Q.add(new Pair(X, Y - 1));
                    }
                }

                if (check(X, Y + 1) && !F[K][X][Y + 1]) {
                    F[K][X][Y + 1] = true;
                    if (D[X][Y + 1] > D[X][Y] + 1) {
                        D[X][Y + 1] = D[X][Y] + 1;
                        Q.add(new Pair(X, Y + 1));
                    }
                }

            }

        }

        boolean check(int X, int Y) {
            return !(X < 0 || X >= N || Y < 0 || Y >= M);
        }

        class Pair {
            int X, Y;

            Pair(int X, int Y) {
                this.X = X;
                this.Y = Y;
            }
        }

        long gcd(long A, long B) {
            if (B == 0) return A;
            return gcd(B, A % B);
        }

        boolean isPrime(long n) {
            if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0))
                return false;
            for (long i = 5, j = 2; i * i <= n; i += j, j = 6 - j)
                if (n % i == 0)
                    return false;
            return true;
        }

        boolean isEqual(double A, double B) {
            return Math.abs(A - B) < eps;
        }

        double dist(double X1, double Y1, double X2, double Y2) {
            return Math.sqrt((X1 - X2) * (X1 - X2) + (Y1 - Y2) * (Y1 - Y2));
        }

        boolean nextPer(int[] data) {
            int i = data.length - 1;
            while (i > 0 && data[i] < data[i - 1]) {
                i--;
            }
            if (i == 0) {
                return false;
            }
            int j = data.length - 1;
            while (data[j] < data[i - 1]) {
                j--;
            }
            int temp = data[i - 1];
            data[i - 1] = data[j];
            data[j] = temp;
            Arrays.sort(data, i, data.length);
            return true;
        }

        long pow(long A, long B, long MOD) {
            if (B == 0) {
                return 1;
            }
            if (B == 1) {
                return A;
            }
            long val = pow(A, B / 2, MOD);
            if (B % 2 == 0) {
                return val * val % MOD;
            } else {
                return val * (val * A % MOD) % MOD;
            }
        }
    }

    private static class InputReader {
        StringTokenizer st;
        BufferedReader br;

        public InputReader(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public InputReader(FileReader s) throws FileNotFoundException {
            br = new BufferedReader(s);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public String nextLine() {
            try {
                return br.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public boolean ready() {
            try {
                return br.ready();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
    }
}