import typing

class Matrix:
	def __init__(self, n: int, m: int, mat: typing.Union[list, None] = None, mod: int = 998244353) -> None:
		self.n = n
		self.m = m
		self.mat = [[0] * self.m for i in range(self.n)]
		self.mod = mod
		if mat:
			for i in range(self.n):
				self.mat[i] = mat[i]
	
	def is_square(self) -> None:
		return self.n == self.m
	
	def __getitem__(self, key: int) -> int:
		if isinstance(key, slice):
			return self.mat[key]
		else:
			assert key >= 0
			return self.mat[key]

	def __mul__(self, other: typing.Union["Matrix", int]) -> "Matrix":
		if other.__class__ == Matrix:
			res = [[0] * other.m for i in range(self.n)]
			for i in range(self.n):
				for k in range(self.m):
					for j in range(other.m):
						res[i][j] += self[i][k] * other[k][j]
			for i in range(self.n):
				for j in range(other.m): res[i][j] %= self.mod
			return Matrix(self.n, other.m, res)
		else:
			return self.times(other)
	
	def __rmul__(self, other: typing.Union["Matrix", int]) -> "Matrix":
		return self.times(other)

	def __pow__(self, k: int) -> "Matrix":
		tmp = Matrix(self.n, self.n, self.mat)
		res = Matrix(self.n, self.n)
		for i in range(self.n):
			res[i][i] = 1
		while k:
			if k & 1:
				res *= tmp
			tmp *= tmp
			k >>= 1
		return res

def main():
	import sys
	input = sys.stdin.buffer.readline
	n, m, t = map(int, input().split())
	G = [[0] * n for i in range(n)]
	for _ in range(m):
		a, b = map(int, input().split())
		G[a][b] = 1
		G[b][a] = 1
	G = Matrix(n, n, G)
	G **= t
	b = [[0] * n for i in range(n)]
	b[0][0] = 1
	G *= Matrix(n, n, b)
	print(G.mat[0][0])
if __name__ == '__main__':
	main()