#include<bits/stdc++.h>
using namespace std;

#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;



void solve(){
    ll n,m,t;cin>>n>>m>>t;
    vector<vector<ll> >G(n);
    rep(i,m){
        ll s,t;cin>>s>>t;
        G[s].pb(t);
        G[t].pb(s);
    }
    vector<ll>a(n);
    a[0]=1;
    rep(i,t){
        vector<ll>b(n);
        rep(j,n){
            for(auto e:G[j]){
                b[j]+=a[e];
                b[j]%=mod;
            }
        }
        swap(a,b);
    }
    cout<<a[0]<<endl;
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}