// Original C++ solution (slower):
#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#define int long long

#define fre(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)

using namespace std;



inline int read(){

	int sum=0,f=1;char ch=getchar();

	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}

	while(ch>='0'&&ch<='9'){sum=sum*10+ch-'0';ch=getchar();}

	return f*sum;

}



const int N=1000005;

struct node{int x,y;}p[N];

int n,H,W,ans=0;

int Y,a[N],b[N],que[N];



inline bool cmp(node a,node b){return a.x<b.x;}



inline void solve(int l,int r){

	if(l==r) return ;

	int mid=(l+r)>>1;

	for(int i=mid,y1=0,y2=H;i>=l;i--){

		a[i]=y1;b[i]=y2;

		if(p[i].y>=Y) y2=min(y2,p[i].y);

		if(p[i].y<=Y) y1=max(y1,p[i].y);

	}

	for(int i=mid+1,y1=0,y2=H;i<=r;i++){

		a[i]=y1;b[i]=y2;

		if(p[i].y>=Y) y2=min(y2,p[i].y);

		if(p[i].y<=Y) y1=max(y1,p[i].y);

	}

	for(int i=mid,j=i+1,h=1,t=0;i>=l;i--){

		while(j<=r&&a[j]<=a[i]){

			while(h<=t&&b[j]+p[j].x>=b[que[t]]+p[que[t]].x) t--;

			que[++t]=j++;

		}

		while(h<t&&min(b[i],b[que[h]])+p[que[h]].x<=min(b[i],b[que[h+1]])+p[que[h+1]].x) h++;

		ans=max(ans,(min(b[i],b[que[h]])-a[i]+p[que[h]].x-p[i].x)<<1);

	}

	for(int i=mid+1,j=i-1,h=1,t=0;i<=r;i++){

		while(j>=l&&a[j]<=a[i]){

			while(h<=t&&b[j]-p[j].x>=b[que[t]]-p[que[t]].x) t--;

			que[++t]=j--;

		}

		while(h<t&&min(b[i],b[que[h]])-p[que[h]].x<=min(b[i],b[que[h+1]])-p[que[h+1]].x) h++;

		ans=max(ans,(min(b[i],b[que[h]])-a[i]+p[i].x-p[que[h]].x)<<1);

	}

	solve(l,mid);solve(mid+1,r);

}



inline void work(){

	sort(p+1,p+n+1,cmp);

	Y=H>>1;

	p[n+1].x=W;p[0].x=0;

	p[n+1].y=p[0].y=Y;

	solve(0,n+1);

}



signed main(){

	W=read();H=read();n=read();ans=max(W+1,H+1)*2;

	for(int i=1;i<=n;i++) p[i].x=read(),p[i].y=read();

	work();

	swap(W,H);

	for(int i=1;i<=n;i++) swap(p[i].x,p[i].y);

	work();

	printf("%lld\n",ans);

	return 0;

}


// Optimized solution to the same problem (faster):
#include<cstdio>

#include<cstring>

#include<algorithm>

template<class _Tp>_Tp max(_Tp a,_Tp b){if(a>b) return a;return b;}

template<class _Tp>_Tp min(_Tp a,_Tp b){if(a<b) return a;return b;}

template<class _Tp>void ckmax(_Tp &a,_Tp b){if(a<b) a=b;}

template<class _Tp>void ckmin(_Tp &a,_Tp b){if(a>b) a=b;}

template<class _Tp>void sswap(_Tp &a,_Tp &b){_Tp c=a;a=b;b=c;}

int read(){

	char ch=getchar();bool f=1;int x=0;

	while((ch<'0' || ch>'9') && ch!='-') ch=getchar();

	if(ch=='-') f=0,ch=getchar();

	while(ch>='0' && ch<='9'){x=x*10+(ch&15);ch=getchar();}

	return f?x:-x;

}

#define N 300010

class Point{

    public:int x,y;

    bool friend operator <(Point a,Point b){return a.x<b.x;}

}p[N];

class tree{

	public:int l,r,w,tag;

}t[N*4];

#define ls (x<<1)

#define rs ((x<<1)|1)

void pushu(int x){

    if(t[x].l==t[x].r)return;

    t[x].w=max(t[ls].w,t[rs].w);

}

void pushd(int x){

    int tag=t[x].tag;

    t[ls].tag+=tag;t[ls].w+=tag;

    t[rs].tag+=tag;t[rs].w+=tag;

    t[x].tag=0;

}

void build(int x,int l,int r){

    t[x].l=l;t[x].r=r;

	t[x].tag=0;t[x].w=0;

    if(l==r)return;

    int mid=(l+r)/2;

    build(ls,l,mid);

    build(rs,mid+1,r);

}

void update(int x,int l,int r,int val){

    if(l<=t[x].l&&t[x].r<=r){

        t[x].tag+=val;

        t[x].w+=val;

        return;

    }

    if(t[x].tag&&t[x].l!=t[x].r)pushd(x);

    if(l<=t[ls].r)update(ls,l,r,val);

    if(r>=t[rs].l)update(rs,l,r,val);

    pushu(x);

}

int stk[2][N],top0,top1,ans,w,h,n;

void solve(){

    build(1,1,n);

    std::sort(p+2,p+n+1);

    top0=top1=0;

    stk[0][0]=stk[1][0]=1;

    update(1,1,n,h*2);

    for(int i=2;i<=n;++i){

        update(1,1,i-1,(p[i].x-p[i-1].x)*2);

        ckmax(ans,t[1].w);

        if(p[i].y*2>=h){

            update(1,stk[0][top0],i-1,(p[i].y-h)*2);

            while(top0&&p[stk[0][top0]].y>=p[i].y){

                update(1,stk[0][top0-1],stk[0][top0]-1,(p[i].y-p[stk[0][top0]].y)*2);

                top0--;

            }++top0;

            stk[0][top0]=i;

        }else{

            update(1,stk[1][top1],i-1,-p[i].y*2);

            while(top1&&p[stk[1][top1]].y<=p[i].y){

                update(1,stk[1][top1-1],stk[1][top1]-1,(p[stk[1][top1]].y-p[i].y)*2);

                top1--;

            }++top1;

            stk[1][top1]=i;

        }

    }

}

int main(){

	w=read();h=read();n=read()+2;

    for(int i=2;i<n;++i)

    	p[i].x=read(),p[i].y=read();

    p[n].x=w;p[n].y=h;

    solve();

    sswap(w,h);

    for(int i=2;i<=n;++i)

        sswap(p[i].x,p[i].y);

    solve();

    printf("%d\n",ans);

}

// Fastest known solution for this problem: