import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [[(-1, 0), (1, 0)], [(0, -1), (0, 1)]]
inf = 10**16
# md = 998244353
# md = 10**9+7
md = 10**8+7

def nCr(com_n, com_r):
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md

# 準備
n_max = 200005
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md

def zeta(aa):
    n = len(aa).bit_length()-1
    res = aa[:]
    for i in range(n):
        for s in range(1 << n):
            if s >> i & 1: res[s] += res[s ^ 1 << i]
    return res

h, w, k = MI()
ab = LLI(k)+[[0, 0], [h, w]]

uab = sorted(enumerate(ab), key=lambda x: sum(x[1]))
# print(uab)

way = [[0]*(k+2) for _ in range(k+2)]
for r in range(k+2):
    v, [a1, b1] = uab[r]
    for l in range(r):
        u, [a0, b0] = uab[l]
        da = a1-a0
        db = b1-b0
        if da < 0 or db < 0: continue
        way[u][v] = nCr(da+db, da)
# print(way)

popcnt = lambda x: bin(x).count("1")
path = [0]*(1 << k)
for s in range(1 << k):
    pu = k
    cur = 1
    for u, [a, b] in uab[1:]:
        if s >> u & 1 == 0: continue
        if way[pu][u] == 0: break
        cur = cur*way[pu][u]%md
        pu = u
    else:
        cur = cur*way[pu][k+1]%md
        if popcnt(s) & 1: path[s] = cur
        else: path[s] = -cur
# print(path)

ans = [way[k][k+1]]*(1 << k)
path[0] = 0
ng = zeta(path)
for s in range(1 << k):
    ans[s] = (ans[s]-ng[s])%md
# print(ng)

print(*ans, sep="\n")