#include<bits/stdc++.h>
#include<iostream>
using namespace std;
using LL = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const int INF = 1 << 29;
const long long LINF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define rep(i,n) for(int i = 0; i < (n); ++i)
template<class T>void chmin(T&a, T b){if(a > b) a = b;}
template<class T>void chmax(T&a, T b){if(a < b) a = b;}


int main(){
	int N, M, T;
	cin >> N >> M >> T;
	vector<vector<bool>> path(N, vector<bool>(N, false));
	for(int i = 0; i < M; ++i){
		int s, t; cin >> s >> t;
		path[s][t] = true;
		path[t][s] = true;
	}

	vector<vector<long long>> dp(T+1, vector<long long>(N, 0));
	dp[0][0] = 1;
	for(int t = 1; t <= T; ++t){
		for(int n = 0; n < N; ++n){
			//t日目のnの都市について考える
			long long tmp = 0;
			for(int p = 0; p < N; ++p){
				if(path[n][p]) tmp += dp[t-1][p] % 998244353;
			}
			dp[t][n] = tmp;
		}
	}

	/*
	for(int i = 0; i < T; ++i){
		for(int j = 0; j < N; ++j){
			cout << dp[i][j] << " ";
		}
		cout << endl;
	}
	*/


	cout << dp[T][0] << endl;


}