#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define int long long

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 3e18;
const double eps = 1e-9;

int X[100010];
int Y[100010];
pii pos[100010];
int v[100010];

signed main()
{ // #define int long long ?????????????????§scanf???????????¨???????????????????????\?????????????????????
    int W, H; cin >> W >> H;

    int N; cin >> N;

    rep(i, N) {
        cin >> X[i];
        cin >> Y[i];
        pos[i] = pii(X[i], Y[i]);
    }

    sort(X, X + N);
    sort(Y, Y + N);

    int x, y;
    
    if (N % 2 == 0) {
        int ans = inf;
        int ansx = -1, ansy = -1;

        rep(i, 2) {
            rep(j, 2) {
                int x = X[N / 2 - i], y = Y[N / 2 - j];
                
                int sum = 0;
                int ma = 0;
                rep(k, N) {
                    int a = abs(x - pos[k].fst) + abs(y - pos[k].scd);
                    sum += a * 2;
                    chmax(ma, a);
                }
                sum -= ma;

                if (ans >= sum) {
                    ans = sum;
                    ansx = x;
                    ansy = y;
                }
            }
        }

        cout << ans << endl;
        cout << ansx << ' ' << ansy << endl;
    } else {
        x = X[N / 2], y = Y[N / 2];

        int ma = 0;
        int v = 0;

        rep(i, N) {
            int a = abs(x - pos[i].fst) + abs(y - pos[i].scd);
            v += a * 2;
            ma = max(ma, a);
        }
        v -= ma;

        cout << v << endl;
        cout << x << ' ' << y << endl;
    }
}