#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {return pow(modc-2);}
    mint& operator/=(const mint& a){ return (*this) *= a.inv();}
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{ return x == a.x;}
    bool operator != (const mint& a) const{ return x != a.x;}
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
    ll val(){ return x;}
};

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int N, M, K, a, b, L;
    cin >> N >> M >> K;
    K++;
    vector<int> p(N+1);
    vector<vector<int>> E(N);
    for (int i=0; i<M; i++){
        cin >> a >> b;
        a--; b--;
        E[a].push_back(b);
        E[b].push_back(a);
    }

    p[0] = 1;
    for (int i=1; i<=N; i++) p[i] = p[i-1] * K;

    //XをK進数表記した時のi桁目
    auto f=[&](int X, int i){
        X /= p[i];
        X %= K;
        return X;
    };
    L = p[N]-1;

    vector dp(L+1, vector<mint>(N));
    for (int i=0; i<N; i++){
        dp[p[i]][i] = 1;
    }

    for (int i=0; i<L; i++){
        for (int j=0; j<N; j++){
            for (auto k : E[j]){
                if (f(i, k) == K-1) continue;
                dp[i+p[k]][k] += dp[i][j];
            }
        }
    }

    mint ans=0;
    for (int i=0; i<N; i++) ans += dp[L][i];
    cout << ans << endl;

    return 0;
}