#include<bits/stdc++.h>
// #include<atcoder/all>
#include<boost/multiprecision/cpp_int.hpp>

using namespace std;
// using namespace atcoder;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}

int n,m,K;
vvi memo(531451,vi(10,-1));
vvi v(10);
vi Kp1(10,1);
inline ll dfs(ll msk,int ov){
    if(memo[msk][ov] != -1)return memo[msk][ov];
    ll MSK = msk;
    ll ok = 0;
    rep(i,n){
      if(MSK%(K+1) != K)ok += (1 << i);
      MSK /= (K+1);
    }
    if(!ok)return memo[msk][ov] = 1;
    ll res = 0;
    for(auto nv : v[ov]){
      if(!(ok >> nv & 1))continue;
      msk += Kp1[nv];
      (res += dfs(msk,nv))%= MOD;
      msk -= Kp1[nv];
    }
    return memo[msk][ov] = res;
  };

int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m >> K;
  rep(i,9)Kp1[i+1] = Kp1[i]*(K+1);
  rep(i,m){
    int a,b;cin >> a >> b;
    a--;b--;
    v[a].emplace_back(b);
    v[b].emplace_back(a);
  }
  ll res = 0;
  rep(i,n){
    (res += dfs(Kp1[i],i))%= MOD;
  }
  cout << res << "\n";

  

  return 0;
}