#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using mint = modint998244353;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, M, K; cin >> N >> M >> K;
    vector g(N, vector<int>(N));
    rep(_,M){
        int u, v; cin >> u >> v;
        u--;
        v--;
        g[u][v] = g[v][u] = 1;
    }

    int L = 1;
    rep(i,N) L *= (K + 1);
    vector dp(N, vector<mint>(L));
    rep(i,N){
        vector<int> cnt(N, 0);
        rep(nxt, N){
            int s_nxt = 0;
            cnt[nxt]++;
            rep(i,N){
                s_nxt *= K + 1;
                s_nxt += cnt[N - 1 - i];
            }

            dp[nxt][s_nxt] = 1;
            cnt[nxt]--;
        }
    }

    rep(s,L)rep(now,N){
        vector<int> cnt(N);

        int x = s;
        rep(i,N){
            cnt[i] = x % (K + 1);
            x /= K + 1;
        }
        if(cnt[now]==0) continue;

        rep(nxt, N)if(g[now][nxt]&&cnt[nxt]<K){
            int s_nxt = 0;
            cnt[nxt]++;
            rep(i,N){
                s_nxt *= K + 1;
                s_nxt += cnt[N - 1 - i];
            }

            dp[nxt][s_nxt] += dp[now][s];
            cnt[nxt]--;
        }
    }

    mint ans = 0;
    rep(i,N) ans += dp[i][L - 1];
    cout << ans << endl;
}