N,M,T = map(int,input().split())
MOD = 998244353
def mulmod(a,b,mod):
    return a*b%mod
def mat_mul_Pypy(A,B):
    return [[sum([mulmod(A[i][k],B[k][j],MOD) for k in range(len(B))])%MOD for j in range(len(B[0]))] for i in range(len(A))]

def mat_power_Pypy(A, N):#行列累乗
    P = [[1 if i==j else 0 for i in range(len(A[0]))] for j in range(len(A))]
    while N:
        if N & 1:
            P = mat_mul_Pypy(P, A)
        A = mat_mul_Pypy(A, A)
        N >>= 1
    return P
mat = [[0] * N for _ in range(N)]
for _ in range(M):
    s,t = map(int,input().split())
    mat[s][t] = 1
    mat[t][s] = 1
P = mat_power_Pypy(mat,T)
initial = [[0] * 1 for _ in range(N)]
initial[0][0] = 1
ans_mat = mat_mul_Pypy(P,initial)
print(ans_mat[0][0])