#include using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return std::vector(arg, init); else return std::vector(arg, vec(init, args...)); } template auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template > T &chmin(T &l, T r, Compare &&f = less()) { return l = min(l, r, f); } template > T &chmax(T &l, T r, Compare &&f = less()) { return l = max(l, r, f); } #include using mint = atcoder::modint998244353; using matrix = vector>; auto melem(const matrix &mat) { matrix m = mat; for (int i = 0; i < size(m); ++i) { for (int j = 0; j < size(m[0]); ++j) { m[i][j] = (i == j); } } return m; } auto mmul(matrix l, matrix r) { int h = size(l); int w = size(r[0]); int s = size(l[0]); matrix m; m.resize(h); for (auto &r : m) { r.resize(w); } for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { m[i][j] = 0; for (int k = 0; k < s; ++k) { m[i][j] += l[i][k] * r[k][j]; } } } return m; } auto mpow(matrix l, int64_t x) { matrix r = melem(l); while (0 < x) { if (x & 1) { r = mmul(r, l); } l = mmul(l, l); x >>= 1; } return r; } int main() { int64_t n, m, t; cin >> n >> m >> t; auto g = vec(uns, n, 0); for (int i = 0; i < m; ++i) { int s, t; cin >> s >> t; g[s].push_back(t); g[t].push_back(s); } matrix dp; dp.resize(n); for (auto &r : dp) { r.resize(n); } for (auto &u : dp) { for (auto &v : u) { v = 0; } } for (int i = 0; i < n; ++i) { for (auto v : g[i]) { dp[i][v] = 1; } } matrix mat; mat.resize(n); for (auto &v : mat) { v.resize(1); v[0] = 0; } mat[0][0] = 1; auto ans = mmul(mpow(dp, t), mat); cout << ans[0][0].val() << endl; }