N, M, K = map(int, input().split())
G = [[] for i in range(N)]
for i in range(M):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    G[u].append(v)
    G[v].append(u)
    
powK = [1] * (N + 1)
for i in range(N):
    powK[i + 1] = powK[i] * (K + 1)
    
K2 = powK[N]
dp = [[0] * N for _ in range(K2)]
for i in range(N):
    dp[powK[i]][i] = 1
    
mod = 998244353
for s in range(powK[N]):
    for u in range(N):
        now = s // powK[u] % (K + 1)
        if now == 0:
            continue
        for v in G[u]:
            now = s // powK[v] % (K + 1)
            if now == K:
                continue
            dp[s + powK[v]][v] += dp[s][u]
            dp[s + powK[v]][v] %= mod
            
print(sum(dp[-1])%mod)