using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, t) = (c[0], c[1], c[2]);
        var map = NArr(m);
        var tree = new List<int>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }
        var mod = 998_244_353;
        var num = new long[n];
        num[0] = 1;
        for (var d = 0; d < t; ++d)
        {
            var nnum = new long[n];
            for (var i = 0; i < n; ++i)
            {
                foreach (var to in tree[i])
                {
                    nnum[i] = (nnum[i] + num[to]) % mod;
                }
            }
            num = nnum;
        }
        WriteLine(num[0]);
    }
}