#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define mod 998244353
struct modint{
	unsigned int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x<o.x?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000005
#define inf 0x3f3f3f3f

int n,m,k;

struct mat{
    modint f[105][105];
    modint*operator [](int x){return f[x];}
};
mat operator *(mat a,mat b){
    mat c;
    For(i,1,n)For(k,1,n)For(j,1,n)
        c[i][j]+=a[i][k]*b[k][j];
    return c;
}
mat operator +(mat a,mat b){
    For(i,1,n)For(j,1,n)a[i][j]+=b[i][j];
    return a;
}
void operator +=(mat&a,mat b){
    For(i,1,n)For(j,1,n)a[i][j]+=b[i][j];
}

struct mat2{
    mat f[2][2];
};
mat2 operator *(mat2 a,mat2 b){
    mat2 c;
    For(i,0,1)For(k,0,1)For(j,0,1)
        c.f[i][j]+=a.f[i][k]*b.f[k][j];
    return c;
}

struct line2{
    mat f[2];
};

int eu[maxn],ev[maxn],deg[maxn];

void work()
{
    n=read(),m=read(),k=read();
    For(i,1,m) eu[i]=read(),ev[i]=read(),++deg[eu[i]],++deg[ev[i]];
    if(k<=2) puts("0"),exit(0);
    mat I,D;
    For(i,1,n) I[i][i]=1,D[i][i]=(1-deg[i]+mod)%mod;
    mat E;
    For(i,1,m) E[eu[i]][ev[i]]=E[ev[i]][eu[i]]=1;
    mat EE=E*E;
    For(i,1,n) EE[i][i]=0;
    mat2 f;
    f.f[0][1]=D;
    f.f[1][1]=E;
    f.f[1][0]=I;
    mat2 p=f;
    k-=2;
    int lg=20;
    while(!(k>>lg&1))--lg;
    Rep(i,lg-1,0){
        p=p*p;
        if(k>>i&1) p=p*f;
    }
    mat res=E*p.f[0][1]+EE*p.f[1][1];
    modint out=0;
    out=res[1][n];
    cout<<out.x;
}
/*
8 1
5 8 5 1

*/

signed main()
{
    work();
	return 0;
}