// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;

#define ll long long
#define MOD 998244353ll

ll pow(ll a, ll x, ll M){
    a %= M;
    if(a == 0) return 0;
    if(x == 0) return 1;
    if(x == 1) return a%M;
    ll k = pow(a, x/2, M);
    k = k*k; k %= M;
    if(x % 2 == 1){
        k *= a; k %= M;
    }
    return k;
}

ll inv2_23(ll x){
    return pow(x, (1ll<<22) - 1, (1ll<<23));
}

ll inv7(ll x){
    return pow(x, 5ll, 7ll);
}

ll inv17(ll x){
    return pow(x, 15ll, 17ll);
}

ll invMOD(ll x){
    return pow(x, MOD - 2, MOD);
}

ll phiN(ll N){
    ll cnt = 0;
    for(ll i=1; i<=N; i++){
        if(__gcd(i, N) == 1) cnt++;
    }
    return cnt;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    ll n, k; cin >> n >> k;
    vector<ll> v(n);
    for(ll i=0; i<n; i++) cin >> v[i];
    if(k <= 46){
        ll k2 = 1ll << k;
        ll r = k2 % n, G = k2 / n;
        ll pi = 1;
        for(ll i=0; i<n; i++){
            pi *= v[i]; pi %= MOD;
        }
        ll pi2 = pow(pi, G, MOD);
        ll u1 = 1;
        for(ll i=0; i<r; i++){
            u1 *= v[i]; u1 %= MOD;
        }
        vector<ll> b(n);
        b[0] = u1 * pi2 % MOD;
        for(ll i=1; i<n; i++){
            b[i] = b[i-1] * invMOD(v[i-1]) % MOD;
            b[i] = b[i] * v[(r+i-1)%n] % MOD;
        }
        for(ll i=0; i<n; i++){
            b[i] %= MOD; b[i] = (b[i] + MOD) % MOD;
        }
        for(ll i=0; i<n; i++) cout << b[i] << " ";
        cout << "\n";
        return 0;
    }

    // r = 2^k % N
    ll phi = phiN(n);
    ll k1 = k % phi;
    ll r = pow(2, k1, n);

    //cout << r << " " << r_real << " rr\n";
    ll e2 = 0;
    while(((n >> e2)&1ll) == 0) e2++;
    ll r1 = r >> e2, n1 = n >> e2;

    //cout << e2 << "\n";

    ll g1 = ((1ll << 23) - r1) * inv2_23(n1) % (1ll << 23);
    ll phi76 = 7*7*7*7*7*6, p76 = 7*7*7*7*7*7;

    ll k2 = k % phi76;
    ll A2 = pow(2, k2, p76) - r;
    A2 %= p76; A2 = (A2 + p76) % p76;
    ll n2 = n;
    while((A2 % 7 == 0) and (n2 % 7 == 0)){
        A2 /= 7; n2 /= 7;
    }
    ll g2 = A2 * inv7(n2) % 7;

    //cout << ((1ll << k) - r - G_real*n) % 7 << " mod7\n";
    //cout << A2 << " " << n2 << "\n";
    //cout << g2 << " " << G_real % 7 << "\n";
    ll phi176 = 17*17*17*17*17*16, p176 = 17*17*17*17*17*17;

    ll k3 = k % phi176;
    ll A3 = pow(2, k3, p176) - r;
    A3 %= p176; A3 = (A3 + p176) % p176;

    ll n3 = n;
    while((A3 % 17 == 0) and (n3 % 17 == 0)){
        A3 /= 17; n3 /= 17;
    }
    ll g3 = A3 * inv17(n3) % 17;

    //cout << g1 << " " << g2 << " " << g3 << "\n";
    
    //cout << G_real % (1ll << 23) << " " << G_real % 7 << " " << G_real % 17 << "\n";

    ll G = g1 * 7 * 17 * inv2_23(7*17) + g2 * (1ll << 23) * 17 * inv7((1ll << 23)*17) + g3 * 7 * (1ll << 23) * inv17(7*(1ll << 23));
    G %= 998244352ll;

    ll pi = 1;
    for(ll i=0; i<n; i++){
        pi *= v[i]; pi %= MOD;
    }
    ll pi2 = pow(pi, G, MOD);
    ll u1 = 1;
    for(ll i=0; i<r; i++){
        u1 *= v[i]; u1 %= MOD;
    }
    vector<ll> b(n);
    b[0] = u1 * pi2 % MOD;
    for(ll i=1; i<n; i++){
        b[i] = b[i-1] * invMOD(v[i-1]) % MOD;
        b[i] = b[i] * v[(r+i-1)%n] % MOD;
    }
    for(ll i=0; i<n; i++){
        b[i] %= MOD; b[i] = (b[i] + MOD) % MOD;
    }
    for(ll i=0; i<n; i++) cout << b[i] << " ";
    cout << "\n";
    return 0;
}