#include <bits/stdc++.h>
#define INF 1000000001LL
#define LNF 1000000000000000001LL
#define MOD 998244353LL
#define MAX 1005
#define long long long
#define all(x) x.begin(),x.end()
using namespace std;

map<pair<int,vector<int>>,long> mp;
vector<int> graph[10];
vector<int> ed;
long dfs(int x,vector<int> cur)
{
    if(cur == ed)
        return 1;
    if(mp.count({x,cur}))
        return mp[{x,cur}];
    
    mp[{x,cur}] = 0;
    auto &t = mp[{x,cur}];
    for(int y : graph[x])
    {
        if(cur[y] == 0)
            continue;
        cur[y]--;
        t= (t+dfs(y,cur))%MOD;
        cur[y]++;
    }
    return t;
}
int main()
{
	ios_base::sync_with_stdio(0); 
    cin.tie(0);
    
    int n,m,k;
    cin >> n >> m >> k;

    for(int i = 0; i<m; i++)
    {
        int a,b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    vector<int> vis(n+1,k);
    ed = vector<int>(n+1);
    vis[0] = 0;
    for(int i = 1; i<=n; i++)
        graph[0].push_back(i);

    cout << dfs(0,vis) << endl;

    return 0;
}