source_code: import java.io.IOException;
  import java.io.OutputStreamWriter;
  import java.io.BufferedWriter;
  import java.util.InputMismatchException;
  import java.io.FileOutputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.io.FileInputStream;
  import java.util.NoSuchElementException;
  import java.io.Writer;
  import java.math.BigInteger;
  import java.io.InputStream;
  
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   * @author Alex
   */
  public class Main {
  	public static void main(String[] args) {
  		InputStream inputStream;
  		try {
  			inputStream = new FileInputStream("input.txt");
  		} catch (IOException e) {
  			throw new RuntimeException(e);
  		}
  		OutputStream outputStream;
  		try {
  			outputStream = new FileOutputStream("output.txt");
  		} catch (IOException e) {
  			throw new RuntimeException(e);
  		}
  		InputReader in = new InputReader(inputStream);
  		OutputWriter out = new OutputWriter(outputStream);
  		TaskC solver = new TaskC();
  		solver.solve(1, in, out);
  		out.close();
  	}
  }
  
  class TaskC {
      public void solve(int testNumber, InputReader in, OutputWriter out) {
  	    int maxdist = -1, maxrow = -1, maxcol = -1;
  	    int rows = in.ri(), cols = in.ri();
  	    int k = in.ri();
  	    IntPair[] points = new IntPair[k];
  	    for(int i = 0; i < k; i++) points[i] = new IntPair(in.ri(), in.ri());
  	    for(int row = 1; row <= rows; row++) {
  		    for(int col = 1; col <= cols; col++) {
  			    int mindist = Integer.MAX_VALUE;
  			    for(int i = 0; i < k; i++)
  				    mindist = Math.min(mindist, Math.abs(row - points[i].first) + Math.abs(col - points[i].second));
  			    if (mindist > maxdist){
  				    maxdist = mindist;
  				    maxrow = row;
  				    maxcol = col;
  			    }
  		    }
  	    }
  	    out.printLine(maxrow, maxcol);
      }
  }
  
  class InputReader {
  	private InputStream stream;
  	private byte[] buf = new byte[1024];
  	private int curChar;
  	private int numChars;
  	private SpaceCharFilter filter;
  
  	public InputReader(InputStream stream) {
  		this.stream = stream;
  	}
  
  	public int read() {
  		if (numChars == -1)
  			throw new InputMismatchException();
  		if (curChar >= numChars) {
  			curChar = 0;
  			try {
  				numChars = stream.read(buf);
  			} catch (IOException e) {
  				throw new InputMismatchException();
  			}
  			if (numChars <= 0)
  				return -1;
  		}
  		return buf[curChar++];
  	}
  	public int ri(){
  		return readInt();
  	}
  
  	public int readInt() {
  		int c = read();
  		while (isSpaceChar(c))
  			c = read();
  		int sgn = 1;
  		if (c == '-') {
  			sgn = -1;
  			c = read();
  		}
  		int res = 0;
  		do {
  			if (c < '0' || c > '9')
  				throw new InputMismatchException();
  			res *= 10;
  			res += c - '0';
  			c = read();
  		} while (!isSpaceChar(c));
  		return res * sgn;
  	}
  	public boolean isSpaceChar(int c) {
  		if (filter != null)
  			return filter.isSpaceChar(c);
  		return isWhitespace(c);
  	}
  
  	public static boolean isWhitespace(int c) {
  		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
  	}
  	public interface SpaceCharFilter {
  		public boolean isSpaceChar(int ch);
  	}
  }
  
  class OutputWriter {
  	private final PrintWriter writer;
  
  	public OutputWriter(OutputStream outputStream) {
  		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
  	}
  	public void print(Object...objects) {
  		for (int i = 0; i < objects.length; i++) {
  			if (i != 0)
  				writer.print(' ');
  			writer.print(objects[i]);
  		}
  	}
  	public void printLine(Object...objects) {
  		print(objects);
  		writer.println();
  	}
  	public void close() {
  		writer.close();
  	}
  }
  
  class IntPair implements Comparable<IntPair> {
  public int first, second;
  
  
  	public IntPair(int first, int second) {
  		this.first = first;
  		this.second = second;
  	}
  	public String toString() {
  		return "(" + first + "," + second + ")";
  	}
  
  	public boolean equals(Object o) {
  		if (this == o) return true;
  		if (o == null || getClass() != o.getClass()) return false;
  
  		IntPair intPair = (IntPair) o;
  
  		return first == intPair.first && second == intPair.second;
  
  	}
  
  	public int hashCode() {
  		int result = first;
  		result = 31 * result + second;
  		return result;
  	}
  
  	public int compareTo(IntPair o) {
  		if (first < o.first)
  			return -1;
  		if (first > o.first)
  			return 1;
  		if (second < o.second)
  			return -1;
  		if (second > o.second)
  			return 1;
  		return 0;
  	}
  }
  
  