#include <bits/stdc++.h>
using namespace std;

long long mod = 998244353;
//入力が必ずmod未満の時に使う.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a;} mint(long long a){v = a;} mint(unsigned long long a){v = a;}
    long long val(){return v;}
    void modu(){v %= mod;}
 
    mint repeat2mint(long long a,long long b){
        mint ret = 1,p = a;
        while(b){if(b&1) ret *= p; p *= p; b >>= 1;}
        return ret;
    };
 
    mint operator-(){return mint(0)-mint(v);}
    mint operator+(mint b){return (v+b.v)%mod;}
    mint operator-(mint b){return (v-b.v+mod)%mod;}
    mint operator*(mint b){return v*b.v%mod;}
    mint operator/(mint b){
        if(b.v == 0) assert(false);
        return v*(repeat2mint(b.v,mod-2)).v%mod;
    }
 
    void operator+=(mint b){v = (v+b.v)%mod;}
    void operator-=(mint b){v = (v-b.v+mod)%mod;}
    void operator*=(mint b){v = v*b.v%mod;}
    void operator/=(mint b){
    if(b.v == 0) assert(false);
        v = v*repeat2mint(b.v,mod-2).v%mod;
    }
 
    void operator++(int){v = (v+1)%mod; return;}
    void operator--(int){v = (v-1+mod)%mod; return;}
    bool operator==(mint b){return v == b.v;}
    bool operator!=(mint b){return v != b.v;}
    bool operator>(mint b) {return v >  b.v;}
    bool operator>=(mint b){return v >= b.v;}
    bool operator<(mint b) {return v <  b.v;}
    bool operator<=(mint b){return v <= b.v;}
 
    mint pow(long long x){return repeat2mint(v,x);}
    mint inv(){return mint(1)/v;}
};			

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int N,M,K; cin >> N >> M >> K;
    vector<vector<int>> Graph(N);
    for(int i=0; i<M; i++){
        int u,v; cin >> u >> v;
        u--; v--;
        Graph.at(u).push_back(v);
        Graph.at(v).push_back(u);
    }
    
    vector<int> pk(N+1,1);
    
    
    for(int i=1; i<=N; i++) pk.at(i) = pk.at(i-1)*(K+1);
    int n = pk.back(); 
    vector<vector<mint>> dp(n,vector<mint>(N));
    for(int i=0; i<N; i++) dp.at(pk.at(i)).at(i) = 1;
    for(int i=0; i<n; i++){
        int ii = i;
        vector<int> now(N);
        for(int k=0; k<N; k++) now.at(k) = ii%(K+1),ii /= K+1;

        for(int k=0; k<N; k++){
            if(dp.at(i).at(k) == 0) continue;
            for(auto to : Graph.at(k)){
                if(now.at(to)+1 > K) continue;
                dp.at(i+pk.at(to)).at(to) += dp.at(i).at(k);
            }
        }
    }
    
    mint answer = 0;
    for(auto d : dp.back()) answer += d;
    cout << answer.v << endl;
}