#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

void solve(){
  ll n,m,k;
  cin >> n >> m >> k;
  VV<ll> G(n);
  rep(i,m){
    ll u,v;
    cin >> u >> v;
    u--;
    v--;
    G[u].eb(v);
    G[v].eb(u);
  }
  V<ll> po(n,1);
  rep(i,n-1) po[i+1] = po[i]*(k+1);
  ll p = 1;
  rep(i, n) p *= (k+1);
  VV<ll> dp(n, V<ll>(p, 0));
  rep(i, n) dp[i][po[i]] = 1;
  
  rep(i, p) rep(j,n) if(dp[j][i]){
    V<ll> K(n, 0);
    ll tmp = i;
    rep(l, n){
      K[l] = tmp%(k+1);
      tmp /= k+1;
    }
    all(nx, G[j]) if(K[nx]<k){
      (dp[nx][i+po[nx]] += dp[j][i])%mod99;
    }
  }
  ll ans = 0;
  rep(i, n) (ans += dp[i][p-1])%=mod99;
  cout << ans << endl;
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}