#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
#define MOD 100000007
ll calc(ll l,ll r,ll d)
{if(!l||!r||!d) return 0;ll ans=0;ll upp=min(l+r,d);ll ps[3]={l+1,r+1,upp};sort(ps,ps+3);ll cl=1;for(int i=0;i<3;i++){ll cr=ps[i];if(cr>upp) break;if(cr<2||cl==cr) continue;++cl;ll vl=min(r,cl-1)-max(cl-l,1LL)+1;ll vr=min(r,cr-1)-max(cr-l,1LL)+1;ans+=(vl+vr)*(cr-cl+1)/2;ans%=MOD;cl=cr;}return ans;
}
ll calc(ll u,ll d,ll l,ll r)
{return calc(u,d,l)+calc(u,d,r)+calc(l,r,u)+calc(l,r,d)+min(u,r)+min(u,l)+min(d,l)+min(d,r);
}
typedef pair<ll,ll> pll;
pll ps[233333];
#define X first
#define Y second
ll n,m,k,ans=0;
bool ok(pll a)
{return a.X>=0&&a.X<n&&a.Y>=0&&a.Y<m;
}
ll tointt(double x)
{if(fabs(x-ll(x+0.5))<1e-5) return x+0.5;return -1;
}
double chk(double x,double y)
{ll xx=tointt(x),yy=tointt(y);if(xx>=0&&xx<n&&yy>=0&&yy<m) return 1;return 0;
}
int main()
{cin>>n>>m>>k; ++n; ++m;ll cnt3=0,cnt4=0;for(ll g=1;g<=n&&g<=m;g++) ans+=(n-g)%MOD*(m-g)%MOD*g%MOD, ans%=MOD;for(int i=1;i<=k;i++){ll x,y;scanf("%lld%lld",&x,&y);ans-=calc(x,n-1-x,y,m-1-y);ans%=MOD;ps[i]=pll(x,y);}sort(ps+1,ps+1+k);for(int i=1;i<=k;i++){for(int j=i+1;j<=k;j++){do{double mx=(ps[i].X+ps[j].X)/2.0,my=(ps[i].Y+ps[j].Y)/2.0;double dx=ps[i].X-mx,dy=ps[i].Y-my;if(chk(mx-dy,my+dx)&&chk(mx+dy,my-dx)) ans++;}while(0);for(int p=-1;p<=1;p+=2){ll dx=ps[j].X-ps[i].X,dy=ps[j].Y-ps[i].Y;pll n1=pll(ps[j].X-dy*p,ps[j].Y+dx*p);pll n2=pll(ps[i].X-dy*p,ps[i].Y+dx*p);if(ok(n1)&&ok(n2));else continue;ans++;int cp=0;if(binary_search(ps+1,ps+1+k,n1)) ++cp;if(binary_search(ps+1,ps+1+k,n2)) ++cp;if(cp==1) cnt3++;else if(cp==2) cnt3++, cnt4++;}}}ans-=cnt3/2; ans-=cnt4/4;printf("%d\n",int(((ans%MOD)+MOD)%MOD));
}