H,W,K = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(K)]
L = [L[i][0]*(W+1)+L[i][1] for i in range(K)]
MOD = 10**8+7
mod = MOD

factorial = [1, 1]
inverse = [1, 1]
invere_base = [0, 1]
for i in range(2, K + 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) #階乗逆元

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

def bit_count(n):
    c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff)
    return c

D = [0]*(1<<K)
for i in range(1<<K):
    X = []
    for j in range(K):
        if i&(1<<j):
            X.append(L[j])
    X.sort()
    lx = len(X)
    a,b = 0,0
    ans = 1
    for j in range(lx):
        na,nb = divmod(X[j],W+1)
        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 bit_count(i)%2:
        ans *= -1
    D[i] = ans%MOD

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])