#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using mint = modint998244353;

mint dp[6][9][9][9][9][9][9];
int N, M, K;
vector<vector<int>> G;

int indies[6];

void dfs(int depth) {

  if (depth == N) {
    for (int i = 0; i < N; i++) {
      for (auto to : G[i]) {
        if (indies[to] == K)
          continue;
        mint tmp = dp[i][indies[0]][indies[1]][indies[2]][indies[3]][indies[4]]
                     [indies[5]];
        indies[to]++;
        dp[to][indies[0]][indies[1]][indies[2]][indies[3]][indies[4]]
          [indies[5]] += tmp;
        indies[to]--;
      }
    }
    return;
  }
  for (int i = 0; i <= K; i++) {
    indies[depth] = i;
    dfs(depth + 1);
  }
}

void solve() {
  for (int i = 0; i < N; i++) {
    indies[i] = 1;
    dp[i][indies[0]][indies[1]][indies[2]][indies[3]][indies[4]][indies[5]] = 1;
    indies[i] = 0;
  }
  dfs(0);
  mint ans = 0;
  for (int i = 0; i < N; i++) {
    ans +=
        dp[i][indies[0]][indies[1]][indies[2]][indies[3]][indies[4]][indies[5]];
  }
  cout << ans.val() << endl;
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N >> M >> K;
  G.resize(N);
  for (int i = 0; i < M; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  solve();
}