#include using namespace std; using int64 = long long; template< int mod > struct Combination { vector< int64_t > mfact, rfact; Combination(int sz) : mfact(sz + 1), rfact(sz + 1) { mfact[0] = 1; for(int i = 1; i < mfact.size(); i++) { mfact[i] = mfact[i - 1] * i % mod; } rfact[sz] = inv(mfact[sz]); for(int i = sz - 1; i >= 0; i--) { rfact[i] = rfact[i + 1] * (i + 1) % mod; } } int64_t fact(int k) const { return (mfact[k]); } int64_t pow(int64_t x, int64_t n) const { int64_t ret = 1; while(n > 0) { if(n & 1) (ret *= x) %= mod; (x *= x) %= mod; n >>= 1; } return (ret); } int64_t inv(int64_t x) const { return (pow(x, mod - 2)); } int64_t P(int n, int r) const { if(r < 0 || n < r) return (0); return (mfact[n] * rfact[n - r] % mod); } int64_t C(int p, int q) const { if(q < 0 || p < q) return (0); return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod); } int64_t H(int n, int r) const { if(n < 0 || r < 0) return (0); return (r == 0 ? 1 : C(n + r - 1, r)); } }; const int mod = 1e8 + 7; int main() { int H, W, K; int A[20], B[20]; cin >> H >> W >> K; for(int i = 0; i < K; i++) { cin >> A[i] >> B[i]; } Combination< mod > latte(H + W + 2); vector< int64 > dp(1 << K); for(int i = 0; i < (1 << K); i++) { vector< pair< int, int > > xs; xs.emplace_back(0, 0); for(int j = 0; j < K; j++) { if((i >> j) & 1) xs.emplace_back(A[j], B[j]); } xs.emplace_back(H, W); sort(begin(xs), end(xs)); bool condition = true; for(int j = 1; j < xs.size(); j++) { if(xs[j - 1].second > xs[j].second) condition = false; } int64 mul = 1; for(int j = 1; j < xs.size(); j++) { int dy = xs[j].first - xs[j - 1].first; int dx = xs[j].second - xs[j - 1].second; (mul *= latte.C(dy + dx, dy)) %= mod; } dp[i] = mul; } for(int i = 0; i < (1 << K); i++) { int64 ret = 0; for(int j = i; j > 0; j = (j - 1) & i) { if(__builtin_popcount(j) % 2) ret += dp[j]; else ret += mod - dp[j]; } printf("%lld\n", (dp[0] + mod - ret % mod) % mod); } }