#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cstdio>
#include <bitset>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <functional>
#include <stack>
#include <cmath>
#include <string>
#include <complex>
#include <cassert>
using namespace std;

typedef long long ll;

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; }

const int INF = (1<<30)-1;
const int MOD = 1e9+7;
const ll LINF = (1ll<<62)-1;

#define REP(i,n) for(int i=0;i<(n);++i)
#define COUT(x) cout<<(x)<<"\n"
#define COUT16(x) cout << fixed << setprecision(16) << (x) << "\n";

ll dp[1010][1010];

int main(){
    int n,m,T,s,t;cin >> n >> m >> T;
    vector<vector<int>> road(n);//road[i][j]の時、道が存在
    REP(i,m){
        cin >> s >> t;
        road[s].push_back(t);
        road[t].push_back(s);
    }
    //dpをやるよ
    //dp[i+1][j] iまでに都市jで感染した人数
    dp[0][0] = 1;
    for(int i=0;i<T;i++){
        for(int j=0;j<n;j++){
            for(int k:road[j]){
                dp[i+1][j] += dp[i][k];
                dp[i+1][j] %= 998244353;
            } 
        }
    }
    COUT(dp[T][0]);
}