#pragma GCC target("avx")
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

const int MOD = 998244353;

int N, M;
long long T;

vector<vector<long long>> mul(const vector<vector<long long>> &A, const vector<vector<long long>> &B) {
    vector<vector<long long>> ret(2*N, vector<long long>(2*N, 0));
    for (int i = 0; i < 2*N; i++) {
        for (int j = 0; j < 2*N; j++) {
            for (int k = 0; k < 2*N; k++) {
                ret[i][j] += A[i][k] * B[k][j];
                ret[i][j] %= MOD;
            }
        }
    }

    return ret;
}

vector<vector<long long>> mulx(vector<vector<long long>> &A, const vector<vector<long long>> &B) {
    vector<vector<long long>> ret(2*N, vector<long long>(N, 0));
    for (int i = 0; i < 2*N; i++) {
        for (int j = 0; j < N; j++) {
            for (int k = 0; k < 2*N; k++) {
                ret[i][j] += A[i][k] * B[k][j];
                ret[i][j] %= MOD;
            }
        }
    }

    return ret;
}

int main() {
    cin >> N >> M >> T;
    vector<vector<long long>> edge(N, vector<long long>(N, 0));
    for (int i = 0; i < M; i++) {
        int s, t;
        cin >> s >> t;
        edge[s][t] = edge[t][s] = 1;
    }

    vector<vector<long long>> mat(2*N, vector<long long>(2*N, 0));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            mat[i][j] = mat[i+N][j] = edge[i][j];
        }
        mat[i+N][i+N] = 1;
    }
    vector<vector<long long>> A(2*N, vector<long long>(2*N, 0));
    for (int i = 0; i < 2*N; i++) A[i][i] = 1;

    T--;
    while (T > 0) {
        if (T & 1) {
            A = mul(A, mat);
        }
        mat = mul(mat, mat);
        T >>= 1;
    }
    vector<vector<long long>> B(2*N, vector<long long>(N, 0));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            B[i][j] = edge[i][j];
        }
        B[i+N][i] = 1;
    }

    B = mulx(A, B);

    cout << B[0][0] << endl;
}