#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}


vector<vector<ll>> v_mul(vector<vector<ll>> a,vector<vector<ll>> b){
  int A=a.size(),B=a[0].size(),C=b.size(),D=b[0].size();
  vector<vector<ll>> r(A,vector<ll>(D));
  for(int i=0;i<A;i++){
    for(int k=0;k<B;k++){
      for(int j=0;j<D;j++){
        r[i][j]+=(a[i][k]*b[k][j])%mod;
		r[i][j]%=mod;
      }
    }
  }
  return r;
}
vector<vector<ll>> v_jyo(vector<vector<ll>> a,int64_t N){
  int m=a.size();
  ll H=1;
  vector<vector<ll>> r(m,vector<ll>(m,0));
  for(int i=0;i<m;i++){
    r[i][i]=1;
  }
  while(N>0){
    H*=2;
    if(N%H){
      N-=(H/2);
      r=v_mul(r,a);
    }
    a=v_mul(a,a);
  }
  return r;
}

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	solve();
}



void solve(){
	ll N,M,T;
	cin>>N>>M>>T;
	vector<vector<ll>> G(N,vector<ll>(N));
	rep(roop,M){
		int s,t;
		cin>>s>>t;
		G[s][t]=1,G[t][s]=1;
	}
	cout<<v_jyo(G,T)[0][0]<<"\n";
}