import sys
input = sys.stdin.readline

from itertools import product
mod=998244353

N,M,K=map(int,input().split())
E=[[] for i in range(N)]

def enc(x):
    now=1
    ANS=0
    for i in range(len(x)-1):
        ANS+=now*x[i]
        now*=K+1
    ANS+=now*x[-1]
    return ANS

def dec(x):
    X=[]
    for i in range(N):
        X.append(x%(K+1))
        x//=K+1
    X.append(x)

    return X

for i in range(M):
    u,v=map(int,input().split())
    u-=1
    v-=1
    E[u].append(v)
    E[v].append(u)

def calc(N,M,K,E):

    DP=[0]*(((K+1)**N)*N)

    for i in range(N):
        x=[0]*N+[i]
        x[i]+=1
        DP[enc(x)]=1


    P=list(product(range(0,K+1),repeat=N))
    P.sort(key=lambda x:sum(x))

    POWK=[1]
    for i in range(N):
        POWK.append(POWK[-1]*(K+1)%mod)
        
    for Y in P:
        X=list(Y)+[0]
        for i in range(N):
            X[-1]=i

            if i==0:
                pp=enc(X)
                moto=pp
                k=DP[pp]
            else:
                pp+=POWK[-1]
                k=DP[pp]
            if k==0:
                continue
            #print(X)

            for to in E[i]:
                if X[to]+1<=K:
                    qq=moto+to*POWK[-1]+POWK[to]
                    DP[qq]=(DP[qq]+k)%mod

    ANS=0
    for i in range(N):
        x=[K]*N+[i]
        ANS+=DP[enc(x)]

    return ANS%mod

print(calc(N,M,K,E))