#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

#define int long long
const int MAXN = 25;
const int MOD = 1000000007;

int n, m, k, ans;
int col[MAXN];
vector<int> g[MAXN];

void dfs(int u, int vis){
	if(u == n + 1){
		int res = 1;
		for(int i = 0;i < vis;i ++){
			res = res * (k - i) % MOD;
		}
		ans = (ans + res) % MOD;
		return;
	}
	for(int i = 1;i <= vis;i ++){
		bool ok = 1;
		for(int &v : g[u]){
			if(col[v] == i){
				ok = 0; break;
			}
		}
		if(ok){
			col[u] = i;
			dfs(u + 1, vis);
			col[u] = 0;
		}
	}
	if(vis < k){
		col[u] = vis + 1;
		dfs(u + 1, vis + 1);
		col[u] = 0;
	}
}

signed main(){
	freopen("color.in", "r", stdin);
	freopen("color.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m >> k;
	for(int i = 1, u, v;i <= m;i ++){
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs(1, 0);
	cout << ans << '\n';
	return 0;
}