#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::ios;
const int mod = 998244353;
const int N = 1e5 + 5;
int f[N], g[N], h[N];
int n;

inline int quick_pow(int x, int k)
{
    int res = 1;
    while (k)
    {
        if (k & 1)
            res = 1ll * res * x % mod;
        x = 1ll * x * x % mod;
        k >>= 1;
    }
    return res;
}

inline void add(int &x, int y)
{
    x += y;
    x >= mod ? x -= mod : 0;
}

inline void calc(int *f, int *g)
{
    for (int i = 1; i <= n; ++i)
        h[i] = 0;
    for (int i = 1; i <= n; ++i)
        for (int j = i; j <= n; j += i)
            h[j] = (1ll * f[i] * g[j / i] + h[j]) % mod;
    for (int i = 1; i <= n; ++i)
        f[i] = h[i];
}

inline void dpow(int k, int *x, int *res)
{
    for (int i = 2; i <= n; ++i)
        res[i] = 0;
    res[1] = 1;
    while (k)
    {
        if (k & 1)
            calc(res, x);
        calc(x, x);
        k >>= 1;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int k;
    cin >> n >> k;
    for (int i = 1; i <= n; ++i)
        cin >> g[i];
    dpow(quick_pow(k, mod - 2), g, f);
    for (int i = 1; i <= n; ++i)
        cout << f[i] << ' ';
    cout << '\n';
}