H,W,K = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(K)]
L = [[L[i][0],L[i][1],L[i][0]+L[i][1]*10**(-11)] for i in range(K)]
L.sort(key = lambda x:x[2])
L = [L[i][:2] for i in range(K)]
MOD = 10**8+7

factorial = [1, 1]
inverse = [1, 1]
invere_base = [0, 1]
for i in range(2, H+W + 1):
    factorial.append((factorial[-1] * i) % MOD)
    invere_base.append((-invere_base[MOD % i] * (MOD // i)) % MOD) #逆元
    inverse.append((inverse[-1] * invere_base[-1]) % MOD) #階乗逆元

def nCr(n, r):
    if (r < 0 or r > n):
        return 0
    r = min(r, n - r)
    return factorial[n] * inverse[r] * inverse[n - r] % MOD

D = [0]*(1<<K)
for i in range(1<<K):
    a,b = 0,0
    ans = 1
    for j in range(K):
        if i&(1<<j):
            na,nb = L[j]
            da,db = na-a,nb-b
            ans *= nCr(da+db,db)
            ans %= MOD
            a,b = na,nb
    na,nb = H,W
    da,db = na-a,nb-b
    ans *= nCr(da+db,db)
    ans %= MOD
    if bin(i).count("1")%2:
        ans *= -1
    D[i] = ans

dp = [D[i] for i in range(1<<K)]
for j in range(K):
    ndp = [0]*(1<<K)
    for i in range(1<<K):
        if i&(1<<j):
            ndp[i] = dp[i]+dp[i&(~(1<<j))]
        else:
            ndp[i] = dp[i]
        ndp[i] %= MOD
    dp = ndp

for i in range(1<<K):
    print(dp[i])