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[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, x) = (c[0], c[1], c[2]);
        var map = NMap(m);
        WriteLine(string.Join("\n", Adv(n, m, x, map)));
    }
    static long[] Adv(int n, int m, int x, int[][] map)
    {
        var move = new int[n][];
        for (var i = 0; i < n; ++i) move[i] = new int[n];
        foreach (var road in map)
        {
            ++move[road[0]][road[1]];
            if (road[0] != road[1]) ++move[road[1]][road[0]];
        }
        var p = new long[n * n][];
        for (var i = 0; i < p.Length; ++i) p[i] = new long[n * n];
        for (var i = 0; i < n; ++i) for (var j = 0; j < n; ++j)
        {
            // yesterday: i, today: j, tomorrow: k
            if (move[i][j] == 0) continue;
            var jm = (int[]) move[j].Clone();
            --jm[i];
            var sum = jm.Sum();
            if (sum == 0)
            {
                p[i * n + j][j * n + j] = 1;
                p[j * n + j][j * n + i] = 1;
            }
            else
            {
                var rev = Exp(sum, mod - 2);
                for (var k = 0; k < n; ++k)
                {
                    p[i * n + j][j * n + k] = jm[k] * rev % mod;
                }
            }
        }
        var a = new long[][] { new long[n * n] };
        {
            var im = (int[]) move[0].Clone();
            var sum = im.Sum();
            if (sum == 0)
            {
                var ans2 = new long[n];
                ans2[0] = 1;
                return ans2;
            }
            var rev = Exp(sum, mod - 2);
            for (var j = 0; j < n; ++j) a[0][j] = im[j] * rev % mod;
        }
        var b = Matrix.Mul(a, Matrix.Pow(p, x - 1));
        var ans = new long[n];
        for (var i = 0; i < n; ++i) for (var j = 0; j < n; ++j) ans[j] = (ans[j] + b[0][i * n + j]) % mod;
        return ans;
    }
    static int mod = 998_244_353;
    static long Exp(long n, long p)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
    class Matrix
    {
        // 行列の累乗
        public static long[][] Pow(long[][] m, long k)
        {
            var multi = m;
            var r = new long[m.Length][];
            for (var i = 0; i < m.Length; ++i)
            {
                r[i] = new long[m.Length];
                r[i][i] = 1;
            }
            while (k > 0)
            {
                if ((k & 1) == 1) r = Mul(r, multi);
                multi = Mul(multi, multi);
                k >>= 1;
            }
            return r;
        }
        // 行列の積
        public static long[][] Mul(long[][] x, long[][] y)
        {
            var r = new long[x.Length][];
            for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length];
            for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k)
            {
                for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod;
            }
            return r;
        }
    }
}