#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
#define mod 100000007
#define ll long long
#define int long long
#define K 1000007
using namespace std;
int n,m,k;
int sum0,sum1,sum2,sum3,sum4;
struct node{int x,y;}wor[300003];
struct hsss{int key,nxt;}data[300003];
int num,h[10000003];
//bool iswor[3003][3003];
inline int query(int x,int y)
{for(register int i=1;i<=k;++i)if(wor[i].x==x&&wor[i].y==y)return 1;return 0;
}
inline void ins(int key)
{int x=key%K;for(int i=h[x];i;i=data[i].nxt)if(data[i].key==key)return;data[++num].key=key;data[num].nxt=h[x];h[x]=num;
}
inline int cal(int x,int y,int h)
{ h-=1;if(x>y)swap(x,y); if(h<=x)return (ll)h*(h+1)/2%mod;if(h<=y)return ((ll)x*(x+1)/2+(ll)x*(h-x))%mod; if(h>=x+y)return (ll)x*y%mod; return ((ll)x*(x+1)/2+(ll)x*(y-x)+(ll)(x-1+x-h+y)*(h-y)/2)%mod;
}
/*inline bool query(int key)
{int x=key%K;for(int i=h[x];i;i=data[i].nxt)if(data[i].key==key) return 1;return 0;
}*/
inline void check(int x1,int y1,int x2,int y2)
{ if(x1<0||x1>n||x2<0||x2>n||y1<0||y1>m||y2<0||y2>m)return; int res=query(x1,y1)+query(x2,y2);sum2+=1;if(sum2>=mod)sum2-=mod;sum3+=res;if(sum3>=mod)sum3-=mod;sum4+=(res==2);if(sum4>=mod)sum4-=mod;
}
signed main()
{scanf("%lld %lld %lld",&n,&m,&k);for(register int i=1;i<=k;++i){scanf("%lld %lld",&wor[i].x,&wor[i].y);ins(wor[i].x*(m+1)+wor[i].y);}for(register int i=1;i<=min(n,m);++i){sum0+=i*(n-i+1)*(m-i+1)%mod;sum0%=mod;}for(register int i=1;i<=k;++i){int l=wor[i].x,r=n-wor[i].x,u=wor[i].y,d=m-wor[i].y;sum1+=min(l,u)+min(l,d)+min(r,u)+min(r,d);if(sum1>=mod)sum1-=mod;sum1+=cal(l,r,u);if(sum1>=mod)sum1-=mod;sum1+=cal(l,r,d);if(sum1>=mod)sum1-=mod;sum1+=cal(u,d,l);if(sum1>=mod)sum1-=mod;sum1+=cal(u,d,r);if(sum1>=mod)sum1-=mod;
/*        int l=wor[i].x,r=m-wor[i].x,u=wor[i].y,d=n-wor[i].y;int mn=min(l,r),mx=max(l,r);if(u<=mn)sum1+=(u+3)*u/2;else if(u>mn&&u<=mx)sum1+=(mn+3)*mn/2+(u-mn)*(mn+1);else if(u>=mx+mn+1)sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn+1)*mn/2;else sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn*2+1-u+mx)*(u-mx)/2;if(d<=mn)sum1+=(d+3)*d/2;else if(d>mn&&d<=mx)sum1+=(mn+3)*mn/2+(d-mn)*(mn+1);else if(d>=mx+mn+1)sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn+1)*mn/2;else sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn*2+1-d+mx)*(d-mx)/2;mn=min(u,d),mx=max(u,d);if(l<=mn)sum1+=(l+3)*l/2;else if(l>mn&&l<=mx)sum1+=(mn+3)*mn/2+(l-mn)*(mn+1);else if(l>=mx+mn+1)sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn+1)*mn/2;else sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn*2+1-l+mx)*(l-mx)/2;if(r<=mn)sum1+=(r+3)*r/2;else if(r>mn&&r<=mx)sum1+=(mn+3)*mn/2+(r-mn)*(mn+1);else if(r>=mx+mn+1)sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn+1)*mn/2;else sum1+=(mn+3)*mn/2+(mx-mn)*(mn+1)+(mn*2+1-r+mx)*(r-mx)/2;
*/}for(register int i=1;i<k;++i){for(register int j=i+1;j<=k;++j){int x1=wor[i].x,y1=wor[i].y,x2=wor[j].x,y2=wor[j].y;check(x1+y2-y1,y1+x1-x2,x2+y2-y1,y2+x1-x2);check(x1+y1-y2,y1+x2-x1,x2+y1-y2,y2+x2-x1);if((x1+x2+y1+y2)&1) continue;check(x1+x2+y2-y1>>1,y1+y2+x1-x2>>1,x1+x2+y1-y2>>1,y1+y2+x2-x1>>1);
/*if(A+D-B>0||B+A-C>0||A+D-B<m||B+A-C<n)if(C+D-B>0||C+D-B<m||D+A-C>0||D+A-C<n){sum2++;if(query(A+D-B,B+A-C)||query(C+D-B,D+A-C))sum3++;if(query(A+D-B,B+A-C)&&query(C+D-B,D+A-C))sum4++;}if((A-D+B+C)%2)continue;if((A-D+B+C)%2)continue;if((A-B+D+C)%2)continue;if((A-B+D+C)%2)continue;if((A-D+B+C)/2>0&&(A-D+B+C)/2<m&&B+C-(A-D+B+C)/2>0&&B+C-(A-D+B+C)/2<n)if((A-B+D+C)/2>0&&(A-B+D+C)/2<m&&A+D-(A-B+D+C)/2>0&&A+D-(A-B+D+C)/2<n){sum2++;if(query((A-D+B+C)/2,B+C-(A-D+B+C)/2)||query((A-B+D+C)/2,A+D-(A-B+D+C)/2))sum3++;if(query((A-D+B+C)/2,B+C-(A-D+B+C)/2)&&query((A-B+D+C)/2,A+D-(A-B+D+C)/2))sum4++;}
*/}}
//    cout<<sum0<<" "<<sum1<<" "<<sum2<<" "<<sum3<<" "<<sum4<<endl;cout<<((sum0-sum1+sum2-sum3/3+sum4/6)%mod+mod)%mod<<endl;return 0;
}