#include using namespace std; using ll = long long; template struct prime_modint { using mint = prime_modint; unsigned int v; prime_modint() : v(0) {} prime_modint(unsigned int a) { a %= MOD; v = a; } prime_modint(unsigned long long a) { a %= MOD; v = a; } prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; } prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; } static constexpr int mod() { return MOD; } mint& operator++() {v++; if(v == MOD)v = 0; return *this;} mint& operator--() {if(v == 0)v = MOD; v--; return *this;} mint operator++(int) { mint result = *this; ++*this; return result; } mint operator--(int) { mint result = *this; --*this; return result; } mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; } mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; } mint& operator*=(const mint& rhs) { v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD); return *this; } mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); } mint operator+() const { return *this; } mint operator-() const { return mint() - *this; } mint pow(long long n) const { assert(0 <= n); mint r = 1, x = *this; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } mint inv() const { assert(v); return pow(MOD - 2); } friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; } friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; } friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; } friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; } friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); } friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); } friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; } }; //using mint = prime_modint<1000000007>; using mint = prime_modint<998244353>; long long intpow(long long a, long long b){ long long ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b >>= 1; } return ans; } int main(){ ios::sync_with_stdio(false); cin.tie(0); int n, m, k, u, v; cin >> n >> m >> k; vector> A(n, vector(n)); vector cur(n); vector> dp(intpow(k + 1, n), vector(n)); for(int i = 0; i < m; i++){ cin >> u >> v; u--, v--; A[u][v] = A[v][u] = true; } auto f = [&](int v){ int idx = 0; while(v){ cur[idx++] = v % (k + 1); v /= k + 1; } }; for(int i = 0, d = 1; i < n; i++){ dp[d][i]++; d *= k + 1; } for(int i = 0; i < dp.size(); i++){ f(i); for(int v = 0; v < n; v++){ if(dp[i][v] == 0) continue; for(int u = 0, d = 1; u < n; u++, d *= k + 1){ if(!A[v][u]) continue; if(cur[u] + 1 > k) continue; dp[i + d][u] += dp[i][v]; } } } cout << accumulate(dp.back().begin(), dp.back().end(), mint(0)) << '\n'; }