#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
int E[6][6];
int K;
const ll mo=998244353;
map<vector<int>,ll> dp[6][6][26];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>K;
	FOR(i,M) {
		cin>>x>>y;
		E[x-1][y-1]=E[y-1][x-1]=1;
	}
	FOR(i,N) {
		vector<int> V(N);
		V[i]=1;
		dp[i][i][1][V]=1;
	}
	FOR(i,25) {
		FOR(x,N) FOR(y,N) FORR2(v,p,dp[x][y][i]) {
			auto V=v;
			FOR(k,N) if(E[y][k]) {
				V[k]++;
				if(V[k]<=K) (dp[x][k][i+1][V]+=p)%=mo;
				V[k]--;
			}
		}
	}
	
	ll ret=0;
	if(N*K<=24) {
		vector<int> V(N,K);
		FOR(x,N) FOR(y,N) {
			ret+=dp[x][y][N*K][V];
		}
	}
	else {
		FOR(x,N) FOR(y,N) FORR2(v,p,dp[x][y][24]) {
			vector<int> V(N,K);
			FOR(k,N) V[k]-=v[k];
			V[x]++;
			FOR(k,N) (ret+=p*dp[x][k][N*K-23][v])%=mo;;
		}
	}
	
	
	cout<<ret%mo<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}