#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
#define newline puts("")
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>inline istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 200005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>

// Mod int
const int mod = 1000000007;
struct mint {
  ll x;
  mint():x(0){}
  mint(ll x):x((x%mod+mod)%mod){}
  // mint(ll x):x(x){}
  mint& fix() { x = (x%mod+mod)%mod; return *this;}
  mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
  mint operator+(const mint& a)const{ return mint(*this) += a;}
  mint operator-(const mint& a)const{ return mint(*this) -= a;}
  mint operator*(const mint& a)const{ return mint(*this) *= a;}
  bool operator<(const mint& a)const{ return x < a.x;}
  bool operator==(const mint& a)const{ return x == a.x;}
};
istream& operator>>(istream&i,mint&a){i>>a.x;return i;}
ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;}
typedef vector<mint> vm;
//

// coordinate compression
struct X {
  typedef int T;
  vector<T> d;
  X() {}
  void add(T x) { d.pb(x);}
  void init() {
    sort(rng(d));
    d.erase(unique(rng(d)), d.end());
  }
  int size() const { return sz(d);}
  T operator[](int i) const { return d[i];}
  int operator()(T x) const { return upper_bound(rng(d),x)-d.begin()-1;}
};
//

int H, W;
X xs, ys;
void initXY(vp& a) {
  xs.add(0); xs.add(H);
  ys.add(0); ys.add(W);
  rep(i,2) for (P p : a) {
    xs.add(p.fi+i);
    ys.add(p.se+i);
  }
  xs.init(); ys.init();
  for (P& p : a) p.fi = xs(p.fi), p.se = ys(p.se);
}



int main() {
  int n;
  scanf("%d%d%d",&H,&W,&n);
  vp p(n);
  cin>>p;
  initXY(p);
  int h = sz(xs)-1, w = sz(ys)-1;
  vvl a(h,vl(w));
  rep(i,h)rep(j,w) {
    ll dx = xs[i+1]-xs[i];
    ll dy = ys[j+1]-ys[j];
    a[i][j] = dx*dy;
  }
  mint ans = 0;
  rep(i,n) a[p[i].fi][p[i].se] = -1;
  rep(si,h)rep(sj,w) if (a[si][sj] != -1) {
    vvi dist(h,vi(w,INF));
    queue<P> q;
    q.push(P(si,sj)); dist[si][sj] = 0;
    while (sz(q)) {
      int i = q.front().fi, j = q.front().se; q.pop();
      if (P(i,j) < P(si,sj)) ans += mint(a[si][sj])*a[i][j]*dist[i][j];
      rep(v,4) {
        int ni = i+di[v], nj = j+dj[v];
        if (ni<0||nj<0||ni>=h||nj>=w) continue;
        if (a[ni][nj] == -1) continue;
        if (dist[ni][nj] != INF) continue;
        dist[ni][nj] = dist[i][j]+1;
        q.push(P(ni,nj));
      }
    }
  }
  vi x(H+1), y(W+1);
  rep(i,h) x[xs[i]] = 1;
  rep(i,w) y[ys[i]] = 1;
  vi xc(H), yc(W);
  rep(i,n) xc[xs[p[i].fi]]++;
  rep(i,n) yc[ys[p[i].se]]++;
  int cnt = 0;
  rep(i,H) {
    cnt += xc[i];
    if (x[i]) continue;
    ans += mint((ll)W*i-cnt)*((ll)W*(H-i)-(n-cnt));
  }
  cnt = 0;
  rep(i,W) {
    cnt += yc[i];
    if (y[i]) continue;
    ans += mint((ll)H*i-cnt)*((ll)H*(W-i)-(n-cnt));
  }
  cout<<ans<<endl;
  return 0;
}






















Measured memory_bytes: 15872