#include <iostream>
#include <vector>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

const long long mod=998244353;

vector<vector<long long>> matrix_mul(const vector<vector<long long>>& A,const vector<vector<long long>>&B){
  vector<vector<long long>>C(A.size(),vector<long long>(B.at(0).size(),0));
  for(int i=0;i<A.size();i++){
    for(int k=0;k<B.size();k++){
      for(int j=0;j<B.at(0).size();j++){
        C.at(i).at(j)=(C.at(i).at(j)+A.at(i).at(k)*B.at(k).at(j))%mod;
      }
    }
  }
  return C;
}

vector<vector<long long>> matrix_exp(vector<vector<long long>> X,long long n){
  vector<vector<long long>>Y(X.size(),vector<long long>(X.size(),0));
  for(int i=0;i<X.size();i++){
    Y.at(i).at(i)=1;
  }
  while(n>0){
    if(n&1){
      Y=matrix_mul(Y,X);
    }
    X=matrix_mul(X,X);
    n>>=1;
  }
  return Y;
}

long long calculate_nth(long long n,vector<vector<long long>> A, vector<vector<long long>> b){
  A=matrix_exp(A,n);
  vector<vector<long long>> res;
  res=matrix_mul(A,b);
  return res.at(0).at(0);
}

long long mod_pow(long long x,long long n,long long m){
  long long res=1;
  while(n>0){
    if(n&1){
      res=res*x%m;
    }
    x=x*x%m;
    n>>=1;
  }
  return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long n, m, t;
    cin >> n >> m >> t;
    vector<vector<long long>> a(n, vector<long long>(n, 0));
    vector<vector<long long>> b(n, vector<long long>(n, 0));
    b[0][0] = 1;
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        a[u][v] = 1;
        a[v][u] = 1;
    }
    long long ans;
    ans=calculate_nth(t,a,b);
    cout<<ans<<endl;
}