#include <cstdio>
#include <cmath>
#include <algorithm>
#define INF 1000000000000000
using namespace std;

int w,h,n;
long long ans = INF;
long long ansx = INF,ansy = INF;
int X[100000],Y[100000],x[100000],y[100000];

int main(){
	scanf("%d%d%d",&w,&h,&n);
	for(int i = 0; i < n; i++) scanf("%d%d",X+i,Y+i);
	for(int i = 0; i < n; i++){
		x[i] = X[i];
		y[i] = Y[i];
	}
	if(n == 1){
		printf("0\n");
		printf("%lld %lld\n",x[0],y[0]);
		return 0;
	}
	sort(x,x+n); sort(y,y+n);
	if(n%2 == 0){
		long long Tx[2] = {0,0}, Ty[2] = {0,0};
		for(int i = 0; i < n; i++){
			Tx[0] += abs(x[n/2-1]-X[i]);
			Ty[0] += abs(y[n/2-1]-Y[i]);
			Tx[1] += abs(x[n/2]-X[i]);
			Ty[1] += abs(y[n/2]-Y[i]);
		}
		Tx[0] *= 2; Tx[1] *= 2; Ty[0] *= 2; Ty[1] *= 2;
		for(int i = 0; i < n; i++){
			int zx = (X[i]<=x[n/2-1]),zy = (Y[i]<=y[n/2-1]); //T[0]
			if(ans >= Tx[zx]+Ty[zy]-abs(x[n/2+zx-1]-X[i])-abs(y[n/2+zy-1]-Y[i])){
				if(ans == Tx[zx]+Ty[zy]-abs(x[n/2+zx-1]-X[i])-abs(y[n/2+zy-1]-Y[i])){
					if(x[n/2+zx-1] < ansx){
						ansx = x[n/2+zx-1];
						ansy = y[n/2+zy-1];
					} else if(x[n/2+zx-1] == ansx){
						if(y[n/2+zy-1] < ansy){
							ansx = x[n/2+zx-1];
							ansy = y[n/2+zy-1];
						}
					}
				} else{
					ans = Tx[zx]+Ty[zy]-abs(x[n/2+zx-1]-X[i])-abs(y[n/2+zy-1]-Y[i]);
					ansx = x[n/2+zx-1];
					ansy = y[n/2+zy-1];
				}
			}
		}
		printf("%lld\n",ans);
		printf("%lld %lld\n",ansx,ansy);
	} else{
		long long tx = x[n/2], ty = y[n/2],sx,ex,sy,ey;
		long long T = 0, sum;
		for(int i = 0; i < n; i++) T += abs(tx-X[i])+abs(ty-Y[i]);
		T *= 2;
		for(int i = 0; i < n; i++){
			sum = T-2*(abs(tx-X[i])+abs(ty-Y[i]));
			if(X[i] <= x[n/2-1]){
				sx = tx; ex = x[n/2+1]; 
			} else if(X[i] == x[n/2]){
				sx = x[n/2-1]; ex = x[n/2+1];
			} else{
				sx = x[n/2-1]; ex = tx;
			}
			if(Y[i] <= y[n/2-1]){
				sy = ty; ey = y[n/2+1]; 
			} else if(Y[i] == y[n/2]){
				sy = y[n/2-1]; ey = y[n/2+1];
			} else{
				sy = y[n/2-1]; ey = ty;
			}
			//printf("%lld\n", sum);
			if(sx<=X[i]&&X[i]<=ex&&sy<=Y[i]&&Y[i]<=ey){
				if(ans>=sum){
					if(ans == sum){
						if(ansx > X[i]){
							ansx = X[i];
							ansy = Y[i];
						} else if(ansx == X[i]){
							if(ansy > Y[i]){
								ansx = X[i];
								ansy = Y[i];
							}
						}
					} else{
						ans = sum;
						ansx = X[i];
						ansy = Y[i];
					}
				}
			} else if(sx<=X[i]&&X[i]<=ex){
				if(ans>=sum+min(abs(Y[i]-sy),abs(Y[i]-ey))){
					long long tmp;
					if(abs(Y[i]-sy) <= abs(Y[i]-ey)) tmp = sy;
					else tmp = ey;
					if(ans == sum+min(abs(Y[i]-sy),abs(Y[i]-ey))){
						if(ansx > X[i]){
							ansx = X[i];
							ansy = tmp;
						} else if(ansx == X[i]){
							if(ansy > tmp){
								ansx = X[i];
								ansy = tmp;
							}
						}
					} else{
						ans = sum+min(abs(Y[i]-sy),abs(Y[i]-ey));
						ansx = X[i];
						ansy = tmp;
					}
				}
			} else if(sy<=Y[i]&&Y[i]<=ey){
				if(ans>=sum+min(abs(X[i]-sx),abs(X[i]-ex))){
					long long tmp;
					if(abs(X[i]-sx) <= abs(X[i]-ex)) tmp = sx;
					else tmp = ex;
					if(ans == sum+min(abs(X[i]-sx),abs(X[i]-ex))){
						if(ansx > tmp){
							ansx = tmp;
							ansy = Y[i];
						} else if(ansx == tmp){
							if(ansy > Y[i]){
								ansx = tmp;
								ansy = Y[i];
							}
						}
					} else{
						ans = sum+min(abs(X[i]-sx),abs(X[i]-ex));
						ansx = tmp;
						ansy = Y[i];
					}
				}
			} else if(X[i] >= ex){
				if(Y[i] >= ey){
					if(ans >= sum+(X[i]-ex)+(Y[i]-ey)){
						if(ans == sum+(X[i]-ex)+(Y[i]-ey)){
							if(ansx > ex){
								ansx = ex;
								ansy = ey;
							} else if(ansx == ex){
								if(ansy > ey){
									ansx = ex;
									ansy = ey;
								}
							}
						} else{
							ans = sum+(X[i]-ex)+(Y[i]-ey);
							ansx = ex;
							ansy = ey;
						}
					}
				} else{
					if(ans >= sum+(X[i]-ex)+(sy-Y[i])){
						if(ans == sum+(X[i]-ex)+(sy-Y[i])){
							if(ansx > ex){
								ansx = ex;
								ansy = sy;
							} else if(ansx == ex){
								if(ansy > sy){
									ansx = ex;
									ansy = sy;
								}
							}
						} else{
							ans = sum+(X[i]-ex)+(sy-Y[i]);
							ansx = ex;
							ansy = sy;
						}
					}
				}
			} else{
				if(Y[i] >= ey){
					if(ans >= sum+(sx-X[i])+(Y[i]-ey)){
						if(ans == sum+(sx-X[i])+(Y[i]-ey)){
							if(ansx > sx){
								ansx = sx;
								ansy = ey;
							} else if(ansx == sx){
								if(ansy > ey){
									ansx = sx;
									ansy = ey;
								}
							}
						} else{
							ans = sum+(sx-X[i])+(Y[i]-ey);
							ansx = sx;
							ansy = ey;
						}
					}
				} else{
					if(ans >= sum+(sx-X[i])+(sy-Y[i])){
						if(ans == sum+(sx-X[i])+(sy-Y[i])){
							if(ansx > sx){
								ansx = sx;
								ansy = sy;
							} else if(ansx == sx){
								if(ansy > sy){
									ansx = sx;
									ansy = sy;
								}
							}
						} else{
							ans = sum+(sx-X[i])+(sy-Y[i]);
							ansx = sx;
							ansy = sy;
						}
					}
				}
			}
			//printf("%lld %lld %lld\n", ans, ansx, ansy);
		}
		printf("%lld\n",ans);
		printf("%lld %lld\n",ansx,ansy);
	}
}

Measured memory_bytes: 2608