#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n) - 1; i >= 0; --i) #define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } bool check() { } int nbit() { } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m, k; cin >> n >> m >> k; vector to(n, vector()); rep(i, m) { int u, v; cin >> u >> v; u--, v--; to[u].push_back(v); to[v].push_back(u); } vectorpw(n + 1); pw[0] = 1; rep(i, n)pw[i + 1] = pw[i] * (k + 1); int bit = pw.back(); vector dp(bit, vector(n)); rep(i, n)dp[pw[i]][i] = 1; rep(i, bit) { rep(j, n) { for (auto nj : to[j]) { if (0 == dp[i][j])continue; int cnt = (i / pw[nj]) % (k + 1); if (cnt == k)continue; int ni = i + pw[nj]; dp[ni][nj] += dp[i][j]; } } } mint ans = 0; rep(i, n)ans += dp[bit - 1][i]; cout << ans.val() << endl; return 0; }