import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def toint(arr):
    s=0
    for a in arr[::-1]:s=s*k1+a
    return s

def toarr(s):
    a=[]
    for _ in range(n):
        s,r=divmod(s,k1)
        a.append(r)
    return a

n,m,k=LI()
to=[[] for _ in range(n)]
for _ in range(m):
    u,v=LI1()
    to[u].append(v)
    to[v].append(u)

k1=k+1
dp=[[0]*n for _ in range(k1**n)]
for u in range(n):dp[k1**u][u]=1

for s in range(k1**n):
    for u in range(n):
        arr=toarr(s)
        pre=dp[s][u]
        if pre==0:continue
        for v in to[u]:
            if arr[v]==k:continue
            arr[v]+=1
            ns=toint(arr)
            dp[ns][v]+=pre
            dp[ns][v]%=md
            arr[v]-=1

def modsum(aa):
    res=0
    for a in aa:
        res+=a
        res%=md
    return res

ans=modsum(dp[-1])
print(ans)