#include <bits/stdc++.h>
#define INF 1000000001LL
#define LNF 1000000000000000001LL
#define MOD 998244353LL
#define MAX 1005
#define long long long
#define all(x) x.begin(),x.end()
using namespace std;

int mp[1<<26];
vector<int> graph[10];
int convert(vector<int> arr)
{
    int res = 0;

    int cur = 1;
    for(int i = 0; i<arr.size(); i++)
    {
        res+=cur*arr[i];
        cur*=9;
    }
    return res;
}
long dfs(int x,vector<int> cur, int sum)
{
    if(sum == 0)
        return 1;
    int p = convert(cur);
    if(mp[p] != -1)
        return mp[p];
    mp[p] = 0;
    auto &t = mp[p];
    for(int y : graph[x])
    {
        if(cur[y] == 0)
            continue;
        cur[0] = y;
        cur[y]--;
        t= (t+dfs(y,cur,sum-1))%MOD;
        cur[y]++;
    }
    return t;
}
int main()
{
	ios_base::sync_with_stdio(0); 
    cin.tie(0);
    
    memset(mp,-1,sizeof mp);
    int n,m,k;
    cin >> n >> m >> k;

    for(int i = 0; i<m; i++)
    {
        int a,b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    vector<int> vis(n+1,k);
    vis[0] = 0;
    for(int i = 1; i<=n; i++)
        graph[0].push_back(i);

    cout << dfs(0,vis,k*n) << endl;

    return 0;
}