#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
#endif

#if !defined(_WIN32) && !defined(__CYGWIN__) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define ssz(x) (signed((x).size()))
#define _loop_i_t(j, k) make_signed_t<decltype((j) - (k))>
#define For(i, j, k) for (_loop_i_t(j, k) i = (j); i <= (k); ++i) // NOLINT
#define ForDown(i, j, k)                                                       \
  for (_loop_i_t(j, k) i = (j); i >= decltype(i)(k); --i) // NOLINT
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
CONSTEXPR_FUNC il ll qpow(ll x, ull y, ll mod){ ll ans = 1; x %= mod; while (y) { if (y & 1) (ans *= x) %= mod; (x *= x) %= mod; y >>= 1; } return ans; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y); }
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + (c - '0'); c = getchar(); } x *= f; }
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x), read(y...); }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = 5005, MAXK = 1005, mod = 998244353;
int p, k, n;
vector<int> T[MAXK][MAXN];

namespace Sol1 {
void solve() {}
} // namespace Sol1
namespace Sol2 {
vector<int> cur[MAXN * 2], ins[MAXN * 2], nxt[MAXN * 2];
int cur_sz, ins_sz;
int trans(vector<int> *tr, vector<int> *dist) {
  For(i, 1, 2 * n) dist[i].clear();
  int cnt = 0;
  auto dfs = [&](auto &&self, int x, int pre) -> void {
    cnt++;
    int tmp;
    if (pre)
      dist[n + cnt].eb(pre), dist[pre].eb(n + cnt);
    while (!pre || ssz(tr[x]) == 2)
      dist[n + cnt].eb(x), dist[x].eb(n + cnt),
          tmp = x, x = tr[x][tr[x][0] == pre], pre = tmp;
    dist[n + cnt].eb(x), dist[x].eb(n + cnt);
    for (int v : tr[x])
      if (v != pre)
        self(self, v, x);
  };
  int p = 1;
  while (ssz(tr[p]) != 1)
    p++;
  dfs(dfs, p, 0);
  return n + cnt;
}
/* unordered_ */ map<pii, vector<int>> mp;
/* unordered_ */ set<pii> have;
int bl[MAXN], fa[MAXN * 2];
void merge() {
  mp.clear(), have.clear();
  fill(bl, bl + 1 + n, -1);
  auto dfs1 = [&](auto &&self, int x, int pre) -> void {
    // cerr << x << '\n';
    fa[x] = pre;
    if (x > n)
      for (int v : cur[x])
        if (v != pre)
          bl[v] = x - n;
    for (int v : cur[x])
      if (v != pre)
        self(self, v, x);
  };
  assert(cur_sz > n);
  dfs1(dfs1, n + 1, 0);
  For(i, n + 1, ins_sz) for (int u : ins[i]) {
    if (~bl[u])
      mp[{bl[u], i - n}].eb(u);
    have.emplace(i - n, u);
  }
  int cnt2 = 0;
  For(i, 1, 2 * n) nxt[i].clear();
  for (const auto &[key, vec] : mp) {
    if (ssz(vec) > 1) {
      cnt2++;
      for (int u : vec)
        nxt[u].eb(n + cnt2), nxt[n + cnt2].eb(u);
      if (have.count({key.se, fa[key.fi + n]}))
        nxt[fa[key.fi + n]].eb(n + cnt2), nxt[n + cnt2].eb(fa[key.fi + n]);
    } else if (have.count({key.se, fa[key.fi + n]})) {
      cnt2++;
      nxt[vec[0]].eb(n + cnt2), nxt[n + cnt2].eb(vec[0]);
      nxt[fa[key.fi + n]].eb(n + cnt2), nxt[n + cnt2].eb(fa[key.fi + n]);
    }
  }
  cur_sz = cnt2 + n;
  For(i, 1, 2 * n) cur[i].swap(nxt[i]);
}
void solve() {
  cur_sz = trans(T[1], cur);
  // cerr << cur_sz << '\n';
  // For(i, n + 1, cur_sz) for (int j : cur[i]) cerr << i << ' ' << j << '\n';
  For(i, 2, k) {
    // cerr << "> " << i << '\n';
    ins_sz = trans(T[i], ins);
    // if (i == 3) {
    //   For(j, n + 1, ins_sz) for (int k : ins[j]) cerr << k << ' ' << j <<
    //   '\n'; cerr << "---\n"; For(j, n + 1, ins_sz) for (int k : cur[j]) cerr
    //   << k << ' ' << j << '\n'; cerr << "---\n";
    // }
    merge();
  }
  ll ans = 1;
  For(i, n + 1, cur_sz) if (ssz(cur[i]) > 1) {
    (ans *= qpow(ssz(cur[i]), ssz(cur[i]) - 2, mod)) %= mod;
  }
  cout << ans << '\n';
}
} // namespace Sol2

void Main() {
  read(p, k, n);
  For(i, 1, k) For(j, 1, n - 1) {
    int u, v;
    read(u, v), T[i][u].eb(v), T[i][v].eb(u);
  }
  (p == 0) ? Sol1::solve() : Sol2::solve();
}
} // namespace

signed main() { return Main(), 0; }