#include <bits/stdc++.h>

#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define reps(i,n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i,n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i,n) for (int i = (int)(n); i > 0; --i)
#define loop(i,x,n) for (int i = (int)(x); i < (n); ++i)
#define loops(i,x,n) for (int i = (int)(x); i <= (n); ++i)
#define loopd(i,x,n) for (int i = (int)(x); i > (n); --i)
#define loopds(i,x,n) for (int i = (int)(x); i >= (n); --i)
#define itrep(i,a) for (auto i = begin(a); i != end(a); ++i)
#define itrepd(i,a) for (auto i = rbegin(a); i != rend(a); ++i)
#define all(f,x,...) [&](decltype(x)& whole) { return (f)(begin(whole), end(whole), ##__VA_ARGS__); }(x)
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll inf = static_cast<ll>(1e18);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e18;
ll mod = static_cast<ll>(1e9 + 7);
template<class T> constexpr int sz(const T& a) { return (int)a.size(); }
template<class T> constexpr T pow2(const T a) { return a * a; }
template<class T, class ... Args> constexpr void mins(T& a, Args... args) { a = min<T>({ a, args... }); }
template<class T, class... Args> constexpr void maxs(T& a, Args... args) { a = max<T>({ a,args... }); }
template<class A, int N, class T>
void fillArray(A(&array)[N], const T& val) { std::fill((T*)array, (T*)(array + N), val); }

template<class T>
struct ModInt {
    T x;
    ModInt(T x = 0) :x((x + mod) % mod) {}
    ModInt& operator+=(const ModInt a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    ModInt& operator-=(const ModInt a) {
        if ((x += mod - a.x) >= mod) x -= mod;
        return *this;
    }
    ModInt& operator*=(const ModInt a) {
        (x *= a.x) %= mod;
        return *this;
    }
    ModInt operator+(const ModInt a) const {
        ModInt res(*this);
        return res += a;
    }
    ModInt operator-(const ModInt a) const {
        ModInt res(*this);
        return res -= a;
    }
    ModInt operator*(const ModInt a) const {
        ModInt res(*this);
        return res *= a;
    }
    ModInt pow(T t) const {
        if (!t) return 1;
        ModInt a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }
    ModInt inv() const {
        return pow(mod - 2);
    }
    ModInt& operator/=(const ModInt a) {
        return (*this) *= a.inv();
    }
    ModInt operator/(const ModInt a) const {
        ModInt res(*this);
        return res /= a;
    }
};
using mint = ModInt<long long>;

class Comb {
public:
    Comb() :fac(0), finv(0) {}
    Comb(int n) :fac(n + 1), finv(n + 1)
    {
        fac[0] = 1;
        for (int i = 1; i <= n; ++i) fac[i] = fac[i - 1] * i;
        finv[n] = fac[n].inv();
        for (int i = n; i >= 1; --i) finv[i - 1] = finv[i] * i;
    }
    void resize(int size) { *this = { size }; }
    mint C(int n, int k) {
        if (n < k) return 0;
        if (n < 0 || k < 0) return 0;
        return fac[n] * (finv[k] * finv[n - k]);
    }
    mint P(int n, int k) {
        if (k < 0) return 0;
        return C(n, k) * fac[k];
    }
    // n!
    mint Fac(int n) {
        if (n < 0) return 0;
        return fac[n];
    }
private:
    std::vector<mint> fac;
    std::vector<mint> finv;
};


int h, w, n;
pair<int, int> wall[3005];
mint dp[3005][2];
void solve() {
    cin >> h >> w >> n;
    rep(i, n) {
        int r, c;
        cin >> r >> c; --r; --c;
        wall[i] = make_pair(r, c);
    }
    wall[n] = make_pair(0, 0);
    ++n;
    sort(wall, wall + n);

    Comb com(h + w);
    dp[0][0] = 1;
    rep(i, n) rep(num, 2) loop(j, i + 1, n) {
        if (wall[j].first < wall[i].first || wall[j].second < wall[i].second) continue;
        auto dx = wall[j].first - wall[i].first;
        auto dy = wall[j].second - wall[i].second;
        dp[j][num ^ 1] += dp[i][num] * com.C(dx + dy, dx);
    }

    mint ans = 0;
    rep(i, n) rep(num, 2) {
        auto dx = h - 1 - wall[i].first;
        auto dy = w - 1 - wall[i].second;
        auto val = dp[i][num] * com.C(dx + dy, dx);
        if (num == 0) ans += val;
        else ans -= val;
    }
    cout << ans.x << endl;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}


Measured memory_bytes: 3456