import java.util.Scanner;

public class Celul {

   public static void main (String[] args) {
      Scanner in = new Scanner(System.in);

      int r = in.nextInt();
      int c = in.nextInt();
      int n = in.nextInt();
      int[] x = new int[n];
      int[] y = new int[n];  
      for (int i = 0; i< n; ++i) {
         x[i] = in.nextInt();
         y[i] = in.nextInt();
      }
      int max = -1;
      int resX = 0;
      int resY = 0;
      for (int i = 1; i<= c; ++i) {
         for (int j = 1; j<= r; ++j) {
            int dis = Math.abs(x[0] -j) + Math.abs(y[0] -i);
            for (int k = 1; k< n; ++k) {
               if (Math.abs(x[k] -j) + Math.abs(y[k] -i) < dis) {
                  dis = Math.abs(x[k] -j) + Math.abs(y[k] -i);
               }
            }
            if (dis > max) {
               max = dis;
               resX = j;
               resY = i;
            }
         }
      }
      System.out.println(resX + " " + resY);
   }
}