#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
int mod=1000000007;
int mod1=998244353;

const int N=307;

int r,c,n;
int ans=inf;

int x[N],y[N];

void check(int U,int D)
{
    set<pair<int,int>>X;
    vector<pair<int,int>>E;
    int S=0,L=0,R=0;
    for(int i=1;i<=n;i++)
    {
        if(max(1,x[i]-D)==1) X.insert({y[i],i});
        else E.pb({max(1,x[i]-D),-i});
        if(min(r,x[i]+U)<r) E.pb({min(r,x[i]+U)+1,i});
      //  cout<<max(1,x[i]-D)<<" "<<min(r,x[i]+U)<<endl;
    }
    if(sz(X)==0) return ;
    R=(*X.begin()).st-1;
    L=c-(*--X.end()).st;
    int last=-1;
    for(auto [Y,i]:X)
    {
        if(last!=-1) S=max(S,Y-last-1);
        last=Y;
    }
    X.insert({-inf,0});
    X.insert({inf,0});
    sort(all(E));
    for(auto [t,i]:E)
    {
        if(i<0) X.insert({y[-i],-i});
        else
        {
            X.erase({y[i],i});
            if(sz(X)==2) return ;
            int LL=(*--X.upper_bound({y[i],0})).st;
            if(LL==-inf) R=max(L,LL-1);
            int RR=(*X.upper_bound({y[i],0})).st;
            if(RR==inf) L=max(R,c-RR);
            if(LL!=-inf&&RR!=inf) S=max(S,RR-LL-1);
        }
    }
    ans=min(ans,U+D+max(S,R+L));
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>r>>c>>n;
    for(int i=1;i<=n;i++) cin>>x[i]>>y[i];
    for(int i=0;i<=r;i++) for(int j=0;j<=r;j++) check(i,j);
    cout<<ans;


    return 0;
}
/*
2 4
2
1 1
1 4
*/