MOD = 998244353
N, M, T = map(int, input().split())
G = [list() for _ in range(N)]
for i in range(M):
    s, t = map(int, input().split())
    G[s].append(t)
    G[t].append(s)

dp = [[0] * (N) for _ in range(T + 1)]
dp[0][0] = 1

# 配るDP
for i in range(T):
    for j in range(N):
        x = dp[i][j]
        # 都市j に接続されている都市に配る
        for nex in G[j]:
            dp[i + 1][nex] += x
            dp[i + 1][nex] %= MOD

print(dp[-1][0])