#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint& x) { os << x.val(); return os; }
template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} return os;}
template<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }
template<typename V, typename H> void resize(vector<V>& vec, const H head){ vec.resize(head); }
template<typename V, typename H, typename ... T> void resize(vector<V>& vec, const H& head, const T ... tail){ vec.resize(head); for(auto& v: vec) resize(v, tail...); }
static const ll inf=1e18+7;
static const ld pi=acos(-1);
static const ld eps=1e-10;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
using v4=vector<v3>;

template<class T>struct matrix{
  using mat=vector<vector<T>>;
  mat mul(mat &A,mat &B){
    ll n=A.size();
    ll m=B[0].size();
    ll l=B.size();
    mat C(n,vector<T>(m));
    ll i,j,k;
    for(i=0;i<n;i++)for(j=0;j<m;j++)for(k=0;k<l;k++)C[i][j]+=A[i][k]*B[k][j];
    return C;
  }
  mat powmat(mat X,ll n){
    ll R=X.size();
    mat res(R,vector<T>(R));
    for(ll i=0;i<R;i++)res[i][i]=1;
    while(n) {
      if(n&1) res=mul(res,X);
      X=mul(X,X);
      n>>=1;
    }
    return res;
  }
};

int main(void) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  ll N,M,T;cin>>N>>M>>T;
  
  using mint=modint998244353;
  vector<vector<mint>>g;resize(g,N,N);
  for(ll i=0;i<M;i++){
    ll a,b;cin>>a>>b;
    g[a][b]=g[b][a]=1;
  }
  
  vector<vector<mint>>a0;resize(a0,N,1);
  a0[0][0]=1;
  matrix<mint>mat;
  g=mat.powmat(g,T);
  auto res=mat.mul(g,a0);
  pt(res[0]);
}