#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
int n;
vvmi mat(const vvmi &a, const vvmi &b){
    vvmi res(n, vmi(n, mint(0)));
    rep(i, n)rep(j, n){
        mint c = mint(0);
        rep(k, n)c += a[i][k]*b[k][j];
        res[i][j] = c;
    }
    return res;
}


int main(){
    int m; ll t; cin >> n >> m >> t;
    vvmi base(n, vmi(n, mint(0)));
    rep(i, m){
        int u, v; cin >> u >> v;
        base[u][v] = base[v][u] = mint(1);
    }

    vvvmi dp;
    dp.push_back(base);
    rep(i, 63){
        dp.push_back(mat(dp[i], dp[i]));
    }
    vvmi e(n, vmi(n, mint(0)));
    rep(i, n)e[i][i] = mint(1);
    vvvmi tmp; tmp.push_back(e);

    bitset<64> bs(t);
    rep(i, 64){
        if(bs[i]){
            int len = tmp.size();
            tmp.push_back(mat(tmp[len-1], dp[i]));
        }
    }
    int l = tmp.size();
    cout << tmp[l-1][0][0].val() << endl;
    return 0;
}