#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <random>
#include <algorithm>
#include <chrono>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define compact(v) v.erase(unique(all(v)) , v.end())
#define pi pair<int , int>
#define vi vector<int>
#define FOR(i , l , r) for(int i = l; i <= r; ++ i)
using namespace std;
typedef long long ll;
#define int long long
const int nd = 3001 , mod = 1e9 + 7;
int mul(int a , int b) {return (a * b) % mod;}
int add(int a , int b) {return (a + b) % mod;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<int> dist(1 , (int)2e9);
int f[nd * 3000];
int dp[nd][nd];
void solve(){
int r , c; cin >> r >> c;
int n; cin >> n;
int cnt = 0;
pair<int , int> s = {INT_MAX , INT_MAX} , t = {-1 , -1};
FOR(i , 1 , n){
int x , y; cin >> x >> y;
s = min(s , {x , y}) , t = max(t , {x , y});
++ cnt;
}
int x = t.fi - s.fi + 1 , y = t.se - s.se + 1;
dp[x][y] = f[x * y - cnt];
FOR(i , x , r){
FOR(j , y , c){
if(i == x && j == y) continue;
dp[i][j] = add(mul(dp[i - 1][j] , f[j]) , mul(dp[i][j - 1] , f[i]));
//cout << i << " " << j << " " << dp[i][j] << '\n';
}
}
cout << mul(2 , dp[r][c]) << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#define task "task"
if(fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
f[0] = 1;
for(int i = 1;i < nd * 3000; ++ i) f[i] = mul(i , f[i - 1]);
solve();
return 0;
}
