#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=205,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

int top,sta[N],pw[N],fac[N],ifac[N];
int n,m,k,tot,ans=1,dep[N],num[N],mn[N];
vi g[N];
bool vis[N];

inline int C(int x,int y){return (ll)fac[x]*ifac[y]%mod*ifac[x-y]%mod;}
inline int solve(vi v,int root){
//	for(int i:v) dprintf("%d ",i);dprintf("with root=%d\n",root);
	static bool vis[N];
	for(int i:v) vis[i]=1;
	vis[root]=1;
	int cnt=0;
	for(int i:v)
		for(int j:g[i])
			if(vis[j]&&dep[i]>dep[j]) ++cnt;
	vis[root]=0;
	for(int i:v) vis[i]=0;
	if(cnt==1) return k;
	if(cnt==SZ(v)+1){
		int res=0;
		for(int i=0;i<cnt;i++)
			ch(res,pw[__gcd(i,cnt)]);
		res=(ll)res*exp(cnt,mod-2)%mod;
		return res;
	}
	return C(cnt+k-1,k-1);
}

inline void dfs(int x,int F=0){
	vis[x]=1;num[x]=++tot;
	mn[x]=dep[x];
	for(int y:g[x]){
		if(vis[y]){
			if(y!=F) gmin(mn[x],dep[y]);
			continue;
		}
		dep[y]=dep[x]+1;
		dfs(y,x);
		if(mn[y]>=dep[x]){
			vi v(0);
			while(top&&num[sta[top]]>=num[y])
				v.pb(sta[top]),top--;
			ans=(ll)ans*solve(v,x)%mod;
		}
		else gmin(mn[x],mn[y]);
	}
	sta[++top]=x;
//	dprintf("%d %d\n",x,mn[x]);
}

int main(){
#ifdef rqgao2014
	assert(freopen("input.txt","r",stdin));
#endif
	scanf("%d%d%d",&n,&m,&k);fac[0]=1;
	for(int i=1;i<=200;i++) fac[i]=(ll)fac[i-1]*i%mod;
	ifac[200]=exp(fac[200],mod-2);
	for(int i=200;i;i--) ifac[i-1]=(ll)ifac[i]*i%mod;
	pw[0]=1;for(int i=1;i<=200;i++) pw[i]=(ll)pw[i-1]*k%mod;
	for(int i=1;i<=m;i++){
		int x,y;scanf("%d%d",&x,&y);
		g[x].pb(y);g[y].pb(x);
	}
	for(int i=1;i<=n;i++)
		if(!vis[i]) dfs(i);
	printf("%d\n",ans);
	return 0;
}

Measured memory_bytes: 256