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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n,m,k;cin >> n >> m >> k;
	vector edge(n, vector<bool>(n));
	rep(i,0,m){
		int a, b; cin >> a >> b;
		a--; b--;
		edge[a][b] = 1;
		edge[b][a] = 1;
	}
	map<pair<vector<int>,int>,mint> mp;
	rep(i,0,n){
		mp[pair(vector<int>(n,0),i)] = 1;
	}
	auto calc = [&](auto self, vector<int> state, int i) -> mint {
		if (mp.find(pair(state,i)) != mp.end()) return mp[pair(state,i)];
		mint ret = 0;
		rep(j,0,n){
			if (edge[i][j]){
				state[j]-=1;
				if (state[j]>=0){
					ret += self(self,state,j);
				}
				state[j]+=1;
			}
		}
		mp[pair(state,i)]=ret;
		return ret;
	};

	mint ans=0;
	rep(i,0,n){
		vector<int> state(n,k);
		state[i]-=1;
		ans += calc(calc,state,i);
	}
	cout << ans.val() << '\n';
}