#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using edge = pair<int,int>;
using djikstra = priority_queue<edge, vector<edge>, greater<edge>>;
const int INF = 1e+9;
const ll LINF = (ll)pow(10,18);
const int mod = INF + 7;
const int lmod = 998244353;

int gcd(int a, int b){
    if(a%b == 0){
        return b;
    } else {
        return gcd(b, a%b);
    }
}

int dp[1002][1002] = {0};

int main(){
    int n,m,t;
    cin >> n >> m >> t;

    Graph g(n);

    int a,b;

    for(int i=0; i<m; i++){
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    dp[0][0] = 1;

    for(int i=0; i<t; i++){
        for(int j=0; j<n; j++){
            if(dp[i][j] > 0){
                for(auto v : g[j]){
                    dp[i+1][v] += dp[i][j];
                    dp[i+1][v] %= lmod;
                }
            }
        }
    }

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