#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint998244353;
using vm = vector<mint>;

vector<vector<int>> G;
void make_graph(int N, int M) {
	G.resize(N);
	int x, y;
	rep(i, M) {
		cin >> x >> y;
		G[x].push_back(y);
		G[y].push_back(x);
	}
}

int main() {
	lint N, M, T;
	cin >> N >> M >> T;
	make_graph(N, M);

	lint a=0, b=0, c=0, x, y, z;
	vm dp(N), dp1(N);
	dp[0] = 1;
	rep(_, T) {
		rep(i, N) {
			for (auto t : G[i]) {
				dp1[i] += dp[t];
			}
		}
		swap(dp, dp1);
		rep(i, N) dp1[i] = 0;
	}
	std::cout << dp[0].val() << '\n';
}