MOD = 998244353
N,M,K = map(int,input().split())
P = {}
for _ in range(K):
    x,y = map(int,input().split())
    if x not in P:
        P[x] = []
    if y not in P:
        P[y] = []
    P[y].append(x)
V = list(P.keys())
L = len(V)
indV = {V[i]:i for i in range(L)}
Pbin = {}
for v in P:
    Pbin[v] = 0
    for u in P[v]:
        Pbin[v] |= 1<<indV[u]
J = 0
for v in V:
    if v<=M:
        J += 1
dpf = [0]*(1<<L)
dpf[0] = 1
for i in range(1<<L):
    ic = (1<<L)-1-i
    flag = True
    for k in range(L):
        if (i>>k & 1) and (Pbin[V[k]] & i) != Pbin[V[k]]:
            flag = False
            break
    if not flag:continue
    nextV = 0
    for k in range(L):
        if (ic>>k & 1) and Pbin[V[k]] & i == Pbin[V[k]]:
            nextV |= 1<<k
    for k in range(L):
        if nextV>>k & 1:
            dpf[i|1<<k] = (dpf[i|1<<k]+dpf[i])%MOD
dpg = [0]*(1<<L)
dpg[0] = 1
for i in range(1<<L):
    ic = (1<<L)-1-i
    flag = True
    for k in range(L):
        if (i>>k & 1) and (Pbin[V[k]] & i) != Pbin[V[k]]:
            flag = False
            break
    if not flag:continue
    nextV = 0
    for k in range(L):
        if (ic>>k & 1) and Pbin[V[k]] & i == Pbin[V[k]]:
            if i==0 and V[k]<=M:continue
            else:
                nextV |= 1<<k
    for k in range(L):
        if nextV>>k & 1:
            dpg[i|1<<k] = (dpg[i|1<<k]+dpg[i])%MOD
f = dpf[(1<<L)-1]
g = dpg[(1<<L)-1]
A = [1]*(N+1)
for i in range(2,N+1):
    A[i] = (A[i-1]*i)%MOD
B = [1]*(N+1)
B[N] = pow(A[N],MOD-2,MOD)
for i in range(N-1,1,-1):
    B[i] = (B[i+1]*(i+1))%MOD
def comb(n,k):
    if k<0 or k>n:return 0
    return A[n]*B[k]*B[n-k]%MOD
ans = (comb(N-1,L)*f*(N-L-(M-J))*A[N-L-1])%MOD+(comb(N-1,L-1)*g*A[N-L])%MOD
ans = ans%MOD
print(ans)