#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<double,double> pdd;
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) ll(i.size())
#define FOR(i, j, k, in) for (ll i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (ll i=j ; i>=k ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef tmd
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif

template<class T> inline bool cmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool cmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MOD=1000000007;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll MAXN=1e5+5;
const ll MAXLG=__lg(MAXN)+2;

ll h,w,n;
pair<ll,ll> pos[MAXN];
ll dp[MAXN],fac[200003],rev[200003];

ll mpow(ll a,ll b) {
    if (b == 0) {
        return 1;
    }
    ll hf = mpow(a,b >> 1);
    hf = hf * hf % MOD;
    return b & 1 ? hf * a % MOD : hf;
}

ll inv(ll a) {
    return mpow(a,MOD - 2);
}

ll cob(ll a,ll b) {
    a += b;
    return fac[a] * rev[b] % MOD * rev[a-b] % MOD;
}
/********** Good Luck :) **********/
int main()
{
    IOS();
    cin >> h >> w >> n;
    REP (i,n) {
        cin >> pos[i].X >> pos[i].Y;
    }
    pos[n++] = {h,w};

    sort(pos,pos+n);

    fac[0] = 1;
    rev[0] = 1;
    REP1 (i,200002) {
        fac[i] = fac[i-1] * i % MOD;
        rev[i] = inv(fac[i]);
    }

    REP (i,n) {
        dp[i] = cob(pos[i].X-1,pos[i].Y-1);
        REP (j,i) {
            if (pos[i].X >= pos[j].X && pos[i].Y >= pos[j].Y) {
                dp[i] -= (dp[j] * cob(pos[i].X-pos[j].X,pos[i].Y-pos[j].Y)) % MOD;
                if (dp[i] < 0) {
                    dp[i] += MOD;
                }                
            }
        }
        debug(pos[i],dp[i]);
    }

    cout << dp[n-1] << endl;
    return 0;
}
//DP

Measured memory_bytes: 4352