Problem:
Score : 100 points

Problem Statement

There is a grid with H horizontal rows and W vertical columns.
Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.

In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the others are all empty squares.
It is guaranteed that Squares (1, 1) and (H, W) are empty squares.

Taro will start from Square (1, 1) and reach (H, W) by repeatedly moving right or down to an adjacent empty square.

Find the number of Taro's paths from Square (1, 1) to (H, W), modulo 10^9 + 7.

Constraints

All values in input are integers.

2 \leq H, W \leq 10^5

1 \leq N \leq 3000

1 \leq r_i \leq H

1 \leq c_i \leq W

Squares (r_i, c_i) are all distinct.

Squares (1, 1) and (H, W) are empty squares.

Input

Input is given from Standard Input in the following format:

H W N
r_1 c_1
r_2 c_2
:
r_N c_N

Output

Print the number of Taro's paths from Square (1, 1) to (H, W), modulo 10^9 + 7.

Sample Input 1

3 4 2
2 2
1 4

Sample Output 1

3

There are three paths as follows:

Sample Input 2

5 2 2
2 1
4 2

Sample Output 2

0

There may be no paths.

Sample Input 3

5 5 4
3 1
3 5
1 3
5 3

Sample Output 3

24

Sample Input 4

100000 100000 1
50000 50000

Sample Output 4

123445622

Be sure to print the count modulo 10^9 + 7.

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Linq;
using System.Collections.Generic;
using static System.Console;
using System.Text;
using System.IO;
using static System.Math;
namespace AtCoder
{
    class Program
    {
        static public long[] Sarray() { return ReadLine().Split().Select(long.Parse).ToArray(); }
        static public List<long> Slist() { return ReadLine().Split().Select(long.Parse).ToList(); }

        static readonly long Mod = 1000000000 + 7;

        static void Main(string[] args)
        {
            var HWN = Sarray();
            var H = HWN[0];
            var W = HWN[1];
            var N = HWN[2];
            var wall = new List<Tuple<long, long>>();
            for (var i = 0; i < N; ++i)
            {
                var rc = Sarray();
                wall.Add(Tuple.Create(rc[0], rc[1]));
            }
            wall = wall.OrderBy(h => h.Item1).ThenBy(w => w.Item2).ToList();
            //壁を通る場合の数を数え上げる
            var dp = new long[N, 2];//0:奇数個(+)、1:偶数個(-)
            var cmb = new Combination(H + W, Mod);
            for (var i = (int)N - 1; 0 <= i; --i)
            {
                var left = cmb.com(wall[i].Item1 - 1 + wall[i].Item2 - 1, wall[i].Item1 - 1);
                var right = cmb.com(H - wall[i].Item1 + W - wall[i].Item2, H - wall[i].Item1);
                dp[i, 0] = right;
                for (var j = (int)N - 1; i < j; --j)
                {
                    if (wall[i].Item2 <= wall[j].Item2) //右下にあるもの
                    {
                        var wleft = cmb.com(wall[j].Item1 - wall[i].Item1 + wall[j].Item2 - wall[i].Item2, wall[j].Item1 - wall[i].Item1);
                        var wright = cmb.com(H - wall[j].Item1 + W - wall[j].Item2, H - wall[j].Item1);
                        var wlr = wleft * wright % Mod;
                        dp[i, 0] = (dp[i, 0] + dp[j, 1] * wlr % Mod) % Mod;
                        dp[i, 1] = (dp[i, 1] + dp[j, 0] * wlr % Mod) % Mod;
                    }
                }
            }
            for (var i = (int)N - 1; 0 <= i; --i)
            {
                var left = cmb.com(wall[i].Item1 - 1 + wall[i].Item2 - 1, wall[i].Item1 - 1);
                dp[i, 0] = dp[i, 0] * left % Mod;
                dp[i, 1] = dp[i, 1] * left % Mod;
            }
            long wpath = 0;
            for (var i = 0; i < N; ++i)
                wpath = (wpath + dp[i, 0] - dp[i, 1] + Mod) % Mod;
            var ans = (cmb.com(H - 1 + W - 1, H - 1) - wpath + Mod) % Mod;
            WriteLine(ans);
        }
        public class Combination
        {
            readonly long mod;
            readonly long[] fac, finv, inv;
            public Combination(long n, long mod = 1000000007)
            {
                long max = n + 1;
                this.mod = mod;
                fac = new long[max];
                finv = new long[max];
                inv = new long[max];
                fac[0] = fac[1] = 1;
                finv[0] = finv[1] = 1;
                inv[1] = 1;
                for (int i = 2; i < max; ++i)
                {
                    fac[i] = fac[i - 1] * i % mod;
                    inv[i] = mod - inv[mod % i] * (mod / i) % mod;
                    finv[i] = finv[i - 1] * inv[i] % mod;
                }
            }
            public long com(long n, long k)
            {
                if (n < k) return 0;
                if (n < 0 | k < 0) return 0;
                return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
            }
        }

    }
}