#include<iostream>
#include<set> 
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
const ll MOD=998244353;

int main(){
    int N,M,T;
    cin>>N>>M>>T;
    
    vector<vector<int>> G(N);
    for(int i=0;i<M;i++){
        int s,t;
        cin>>s>>t;
        G[s].push_back(t);
        G[t].push_back(s);
    }

    vector<vector<ll>> num(T+1,vector<ll>(N,0));

    num[0][0]=1;
    for(int t=1;t<=T;t++){
        
        for(int u=0;u<N;u++){
            for(int v:G[u]){
                num[t][v]+=num[t-1][u];
                num[t][v]%=MOD;
            }
        }

    }

    cout<<num[T][0]<<endl;
}