#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

const int MOD = 998244353;

int N, M, K;
vector<int> G[7];
int dp[7][9 * 9 * 9 * 9 * 9 * 9];
int v[7];

int g() {
    int ret = 0;
    int tmp = 1;
    for (int i = 0; i < N; i++) {
        int x = v[i];
        ret += x * tmp;
        tmp *= K + 1;
    }
    return ret;
}

int cnt = 0;

int F(int now) {
    cnt++;
    int num = g();
    
    if (dp[now][num] != -1) {
        return dp[now][num];
    }

    bool ok = true;
    for (int i = 0; i < N; i++) {
        if (v[i] != K) {
            ok = false;
        }
    }

    if (ok) {
        return dp[now][num] = 1;
    }

    int ret = 0;
    for (int nxt : G[now]) {
        if (v[nxt] < K) {
            v[nxt]++;
            ret += F(nxt);
            ret %= MOD;
            v[nxt]--;
        }
    }

    return dp[now][num] = ret;
};

int main() {
    cin >> N >> M >> K;

    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 9 * 9 * 9 * 9 * 9 * 9; j++) {
            dp[i][j] = -1;
        }
    }

    int ans = 0;
    for (int i = 0; i < N; i++) {
        v[i]++;
        ans += F(i);
        ans %= MOD;
        v[i]--;
    }

    cout << ans << endl;
}