#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<stack>
#include<random>
#define N 10000000
#define mod 1315105
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,m,k,ans,seed,length,leng,lengs,a[N+1],dfn[N+1],dfns[N+1],low[N+1],F[N+1],G[N+1],delta[N+1];
bool used[N+1];
vector<int>E[N+1];
vector<int>ES[N+1];
vector<int>dp[N+1];
stack<int>p;
void add(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
void tarjan(int x)
{
	dfn[x]=low[x]=++leng,p.push(x);
	for (int i=0;i<E[x].size();++i)
	{
		if (!dfn[E[x][i]])
		{
			tarjan(E[x][i]),low[x]=min(low[x],low[E[x][i]]);
			if (low[E[x][i]]>=dfn[x])
			{
				++length,ES[x].push_back(length);
				while (p.top()!=E[x][i]) ES[length].push_back(p.top()),p.pop();
				ES[length].push_back(p.top()),p.pop();
			}
		}
		else low[x]=min(low[x],dfn[E[x][i]]);
	}
	return;
}
void merge(int x,int y)
{
	dp[x].push_back(0);
	if (dp[x].size()>dp[y].size()) swap(dp[x],dp[y]);
	for (int i=0;i<dp[x].size();++i)
		if (0<=k-i&&k-i<dp[y].size())
			Adder(ans,1ll*dp[x][dp[x].size()-1-i]*dp[y][dp[y].size()-1-(k-i)]%mod);
	for (int i=0;i<dp[x].size();++i) Adder(dp[y][dp[y].size()-1-i],dp[x][dp[x].size()-1-i]);
	return;
}
void dfs(int x)
{
	int maxn=0,maxer=0,rt=0,smaxn=0,srt=0,d,ds,ps;
	if (x<=n)
	{
		dp[x]={a[x]};
		for (int i=0;i<ES[x].size();++i) dfs(ES[x][i]),merge(ES[x][i],x);
	}
	else
	{
		for (int i=0;i<ES[x].size();++i)
		{
			dfs(ES[x][i]);
			if (dp[ES[x][i]].size()>maxn) maxn=dp[ES[x][i]].size(),maxer=ES[x][i],rt=i;
		}
		for (int i=0;i<ES[x].size();++i)
			if (i!=rt)
			{
			    for (int j=0;j<dp[ES[x][i]].size();++j)
				{
					d=k-j-min(abs(rt-i),(int)(ES[x].size())-abs(rt-i));
					if (0<=d&&d<maxn) Adder(ans,1ll*dp[ES[x][i]][dp[ES[x][i]].size()-1-j]*dp[maxer][maxn-1-d]%mod);
				}
			}
		ps=-1;
		for (int i=0;i<ES[x].size();++i)
		{
			while (((i-(ps+1))<<1)>ES[x].size())
			{
				++ps;
				if (ps!=rt)
				{
					for (int j=0;j<dp[ES[x][ps]].size();++j) Adder2(F[j+i],-dp[ES[x][ps]][dp[ES[x][ps]].size()-1-j]),Adder(G[j+ES[x].size()-1-i],dp[ES[x][ps]][dp[ES[x][ps]].size()-1-j]);
				}
			}
			if (i!=rt)
			{
				for (int j=0;j<dp[ES[x][i]].size();++j)
				{
					if (k-j+ES[x].size()-1-i>=0) Adder(ans,1ll*dp[ES[x][i]][dp[ES[x][i]].size()-1-j]*G[k-j+ES[x].size()-1-i]%mod);
					if (k-j+i-ES[x].size()>=0) Adder(ans,1ll*dp[ES[x][i]][dp[ES[x][i]].size()-1-j]*G[k-j+i-ds]%mod);
				}
				for (int j=0;j<dp[ES[x][i]].size();++j) Adder(F[j+i],dp[ES[x][i]][dp[ES[x][i]].size()-1-j]);
			}
		}
		for (int i=0;i<ES[x].size();++i)
			if (i!=rt)
			{
				if (i<=ps)
				{
					for (int j=0;j<dp[ES[x][i]].size();++j) G[j+i]=0;
				}
				else
				{
					for (int j=0;j<dp[ES[x][i]].size();++j) F[j+ES[x].size()-1-i]=0;
				}
			}
		for (int i=0;i<ES[x].size();++i)
			if (dp[ES[x][i]].size()+min(i,(int)(ES[x].size())-i)>smaxn)
				smaxn=dp[ES[x][i]].size()+min(i,(int)(ES[x].size())-i),srt=i;
		if (srt!=rt)
		{
			dp[x].resize(smaxn);
			for (int i=0;i<ES[x].size();++i)
			{
				for (int j=0;j<dp[ES[x][i]].size();++j) d=j+min(i,(int)(ES[x].size())-i),Adder(dp[x][dp[x].size()-1-d],dp[ES[x][i]][dp[ES[x][i]].size()-1-j]);
			}
		}
		else
		{
			ds=smaxn-dp[maxer].size(),swap(dp[x],dp[maxer]);
			for (int i=1;i<=ds;++i) dp[x].push_back(0);
			for (int i=0;i<ES[x].size();++i)
				if (i!=rt)
				{
					for (int j=0;j<dp[ES[x][i]].size();++j) d=j+min(i,(int)(ES[x].size())-i),Adder(dp[x][dp[x].size()-1-d],dp[ES[x][i]][dp[ES[x][i]].size()-1-j]);
				}
		}
	}
	for (int i=0;i<ES[x].size();++i) dp[ES[x][i]].shrink_to_fit();
	return;
}
int main()
{
	int x,y;
	length=n=read(),m=read(),k=read();
	for (int i=1;i<=m;++i) x=read(),y=read(),add(x,y);
	seed=read();
	mt19937_64 rnd(seed);
	for (int i=1;i<=n;++i) a[i]=(rnd()%inf+1)%mod;
	tarjan(1),dfs(1),printf("%d\n",ans);
	return 0;
}