import sys
input = sys.stdin.readline
from collections import *

def mat_mul(A, B):
    C = [[0]*len(B[0]) for _ in range(len(A))]
    
    for i in range(len(A)):
        for j in range(len(B[0])):
            for k in range(len(A[0])):
                C[i][j] += A[i][k]*B[k][j]
                C[i][j] %= MOD
    
    return C

def mat_pow(A, n):
    res = [[0]*len(A) for _ in range(len(A))]
    
    for i in range(len(A)):
        res[i][i] = 1
    
    while n>0:
        if n&1:
            res = mat_mul(res, A)
        
        n >>= 1
        A = mat_mul(A, A)
    
    return res

N, M, T = map(int, input().split())
A = [[0]*N for _ in range(N)]

for _ in range(M):
    u, v = map(int, input().split())
    A[u][v] = 1
    A[v][u] = 1
    
x = [[0] for _ in range(N)]
x[0][0] = 1
MOD = 998244353
res = mat_mul(mat_pow(A, T), x)
print(res[0][0])