#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
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 <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int n, m, t; cin >> n >> m >> t;
    auto g = vec<int>(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);
    }

    queue<tuple<int, int>> que;
    auto dp = vec<mint>(0, t + 1, n);
    auto vis = vec<bool>(false, t + 1, n);

    dp[0][0] = 1;
    vis[0][0] = true;
    que.push({ 0, 0 });
    while (!empty(que)) {
        auto [d, c] = que.front(); que.pop();

        if (t <= d) {
            continue;
        }

        for (auto v : g[c]) {
            dp[d + 1][v] += dp[d][c];

            if (vis[d + 1][v]) {
                continue;
            }
            vis[d + 1][v] = true;

            que.push({ d + 1, v });
        }
    }

    cout << dp[t][0].val() << endl;
}