#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define lb lower_bound;
#define ub upper_bound;
#define lbi(A, x) (ll)(lb(all(A), x) - A.begin())
#define ubi(A, x) (ll)(ub(all(A), x) - A.begin())
using ll = long long;
using P = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T> >;
template <class T>
const ll INF = 1000000000000000001;
const int inf = 1001001001;
const ll mod = 1000000007;
const ll MOD = 998244353;
inline V<int> dtois(string& s) { V<int> vec = {}; for (auto& e : s) { vec.push_back(e - '0'); } return vec; }


int main(void) {
	int n, m, t;	cin >> n >> m >> t;
	VV<int> route(n, V<int>(0));
	rep(i, 0, m) {
		int a, b;	cin >> a >> b;
		route[a].push_back(b);
		route[b].push_back(a);
	}

	V<ll> dp(n);	V<ll> ndp(n);
	dp[0] = 1;
	rep(i, 1, t + 1) {
		rep(j, 0, n) {
			ndp[j] = 0;
			for (auto& k : route[j]) {
				//cout << i << ' ' << j << ' ' << k << endl;
				ndp[j] += dp[k];
				ndp[j] %= MOD;
			}
		}
		rep(j, 0, n) {
			dp[j] = ndp[j];
			//cout << dp[j] << ',';
		}
		//cout << endl;
	}

	cout << dp[0] << endl;
	return 0;
}