#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

constexpr ll mod = 998244353;

ll dp[1<<10][1<<10];

void add(ll &x,ll y){
    x += y;
    if(x >= mod)x -= mod;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,m,t; cin >> n >> m >> t;
    vector<vector<int>> g(n);
    for(int i=0;i<m;i++){
        int x,y; cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dp[0][0] = 1;
    for(int i=0;i<t;i++){
        for(int j=0;j<n;j++){
            for(int t:g[j]){
                add(dp[i+1][t],dp[i][j]);
            }
        }
    }
    cout << dp[t][0] << endl;
}