#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
//using mint=modint1000000007;
using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
void chmin(ll&a,ll b){a=min(a,b);}
signed main(){
  ll N,M,T;cin>>N>>M>>T;
  vector<vector<mint>>A(N,vector<mint>(N)),E(N,vector<mint>(N));
  REP(i,M){
    ll s,t;cin>>s>>t;
    A[s][t]++;A[t][s]++;
  }
  REP(i,N)E[i][i]=1;
  auto res=E;
  while(T){
    if(T%2){
      //res*=A
      vector<vector<mint>>cal(N,vector<mint>(N));
      REP(i,N)REP(j,N)REP(k,N)cal[i][j]+=res[i][k]*A[k][j];
      res=cal;
    }
    T/=2;
    //A*=A
    vector<vector<mint>>cal(N,vector<mint>(N));
    REP(i,N)REP(j,N)REP(k,N)cal[i][j]+=A[i][k]*A[k][j];
    A=cal;
  }
  cout<<res[0][0].val()<<endl;
  return 0;
}